Target detection using sparsity based deconvolution in passive bistatic radars [Pasif Bistatik Radarlarda Seyreklik Temellli Ters Evrişim Kullanilarak Hedef Tespiti]
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28097
2015 23rd Signal Processing and Communications Applications Conference, SIU 2015 - Proceedings
- Conference Paper 
Institute of Electrical and Electronics Engineers Inc.
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.
Showing items related by title, author, creator and subject.
Range resolution improvement in passive bistatic radars using nested FM channels and least squares approach Arslan, M.T.; Tofighi, M.; Sevimli, R.A.; Çetin, A.E. (SPIE, 2015)One of the main disadvantages of using commercial broadcasts in a Passive Bistatic Radar (PBR) system is the range resolution. Using multiple broadcast channels to improve the radar performance is offered as a solution to ...
Arslan, Musa Tunç (Bilkent University, 2015-11)Passive radar (PR) systems attract interests in radar community due to its lower cost and power consumption over conventional radars. However, one of the main disadvantages of a PR system is its low range resolution. The ...
Deconvolution using projections onto the epigraph set of a convex cost function [Dişbükey maliyet fonksiyonlarinin epigraf kümesine dikey izdüşüm kullanan ters evrişim algoritmasi] Tofighi, M.; Bozkurt, A.; Köse, K.; Çetin, A.E. (IEEE Computer Society, 2014)A new deconvolution algorithm based on making orthogonal projections onto the epigraph set of a convex cost function is presented. In this algorithm, the dimension of the minimization problem is lifted by one and sets ...