Range resolution improvement in passive bistatic radars using nested FM channels and least squares approach
Proceedings of SPIE - The International Society for Optical Engineering
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28274
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 this problem. However, it suffers from detection performance due to the side-lobes that matched filter creates for using multiple channels. In this article, we introduce a deconvolution algorithm to suppress the side-lobes. The two-dimensional matched filter output of a PBR is further analyzed as a deconvolution problem. The deconvolution algorithm is based on making successive projections onto the hyperplanes representing the time delay of a target. Resulting iterative deconvolution algorithm is globally convergent because all constraint sets are closed and convex. Simulation results in an FM based PBR system are presented. © 2015 SPIE.
Showing items related by title, author, creator and subject.
Target detection using sparsity based deconvolution in passive bistatic radars [Pasif Bistatik Radarlarda Seyreklik Temellli Ters Evrişim Kullanilarak Hedef Tespiti] Arslan, M.T.; Tofighi, M.; Cetin, A.E. (Institute of Electrical and Electronics Engineers Inc., 2015)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 ...
Projections onto the epigraph set of the filtered variation function based deconvolution algorithm Tofighi M.; Cetin A.E. (Institute of Electrical and Electronics Engineers Inc., 2017)A new deconvolution algorithm based on orthogonal projections onto the hyperplanes and the epigraph set of a convex cost function is presented. In this algorithm, the convex sets corresponding to the cost function are ...
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 ...