lp-Based complex approximate message passing with application to sparse stepped frequency radar

被引:12
作者
Zheng, Le [1 ]
Liu, Quanhua [2 ]
Wang, Xiaodong [1 ]
Maleki, Arian [1 ]
机构
[1] Columbia Univ, New York, NY 10027 USA
[2] Beijing Inst Technol, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Sparse Stepped Frequency Waveform; Compressed Sensing; l(p)-regularized least squares; Complex Approximate Message Passing; TARGET; DECOMPOSITION; ALGORITHMS; DESIGN;
D O I
10.1016/j.sigpro.2016.12.007
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Compressed sensing exploits the sparsity of the signal to reduce the sampling rate while keeping the resolution fixed, and has been widely used. In this paper we propose a new algorithm called adaptive l(p)-CAMP and show its application in the sparse stepped frequency radar signal processing. Our algorithm is inspired by the complex approximate message passing algorithm (CAMP) that solves complex-valued LASSO. The following properties of the proposed algorithm make it superior to existing algorithms: (1) All the parameters of the algorithm are tuned dynamically and optimally. The algorithm does not require any information about the signal and is still capable of tuning the parameters as well as an oracle that has all the signal information. (2) Adaptive l(p)-CAMP is designed to solve the complex-valued l(p)-regularized least squares for 0 <= p <= 1. Hence, it can outperform CAMP. The performance of the proposed algorithm is verified by simulations and the data collected by a real radar system.
引用
收藏
页码:249 / 260
页数:12
相关论文
共 37 条
[1]   Design and Analysis of Compressed Sensing Radar Detectors [J].
Anitori, Laura ;
Maleki, Arian ;
Otten, Matern ;
Baraniuk, Richard G. ;
Hoogeboom, Peter .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (04) :813-827
[2]  
[Anonymous], 2009, Advances in Neural Information Processing Systems
[3]  
[Anonymous], IEEE SIGNAL PROCESS
[4]   IEEE-SPS and connexions - An open access education collaboration [J].
Baraniuk, Richard G. ;
Burrus, C. Sidney ;
Thierstein, E. Joel .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (06) :6-+
[5]   The LASSO Risk for Gaussian Matrices [J].
Bayati, Mohsen ;
Montanari, Andrea .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (04) :1997-2017
[6]   Exact reconstruction of sparse signals via nonconvex minimization [J].
Chartrand, Rick .
IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (10) :707-710
[7]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[8]  
Deledalle C.-A., 2013, ARXIV13015874
[9]   Message-passing algorithms for compressed sensing [J].
Donoho, David L. ;
Maleki, Arian ;
Montanari, Andrea .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2009, 106 (45) :18914-18919
[10]  
Foucart S., 2013, A Mathematical Introduction to CompressiveSensing