• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Pasif bistatik radarlarda seyreklik temellli ters evrişim kullanılarak hedef tespiti

      Thumbnail
      View / Download
      1.6 Mb
      Author
      Arslan, Musa Tunç
      Tofighi, Mohammad
      Çetin, A. Enis
      Date
      2015-05
      Source Title
      23rd Signal Processing and Communications Applications Conference, SIU 2015 - Proceedings
      Publisher
      IEEE
      Pages
      343 - 346
      Language
      Turkish
      Type
      Conference Paper
      Item Usage Stats
      161
      views
      124
      downloads
      Abstract
      Bu bildiride pasif radar (PR) sistemlerinin menzil çözünürlüğünü artırmak için seyreklik tabanlı bir ters evrişim yöntemi sunulmaktadır. PR sistemlerinin iki boyutlu uyumlu süzgeç çıktısı bir ters evrişim problemli gibi düşünülerek incelenmektedir. Ters evrişim algoritması, hedeflerin zaman kaymaları ve l1 norm benzeri dışbükey maliyet fonksiyonlarının epigraf kümelerini temsil eden hiperdüzlemler üzerine izdüşümü temellidir. Bütün kısıt kümeleri kapalı ve dışbükey olduklarından dolayı yinelemeli algoritma yakınsamaktadır. FM tabanlı PR sistemleri üzerinde benzetim sonuçları sunulmuştur. Algoritma frekans uzayı tabanlı ters evrişim yöntemlerine göre daha yüksek performansa sahiptir.
       
      We introduce a sparsity based deconvolution scheme to improve the range resolution of passive bistatic radar (PBR) systems. The two-dimensional matched filter output of a PBR system is further analyzed as a deconvolution problem. The deconvolution algorithm is based on making projections onto hyperplanes representing the time delay of a target and the epigraph set of a convex cost function such as the l<inf>1</inf> norm. The iterative algorithm is globally convergent because all constraint sets are closed and convex. Simulation results in a FM based PBR system are presented. The proposed method performs better than frequency domain deconvolution methods. © 2015 IEEE.
      Keywords
      Range resolution
      Algorithms
      Cost functions
      Deconvolution
      Frequency domain analysis
      Iterative methods
      Matched filters
      Pattern matching
      Radar
      Time delay
      Convex cost function
      Deconvolution algorithm
      Deconvolution method
      Deconvolution problem
      Globally convergent
      Iterative algorithm
      Passive radars
      Range resolution
      Signal processing
      Permalink
      http://hdl.handle.net/11693/28097
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/SIU.2015.7129829
      Collections
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy