Direction of Arrival Estimation for Off-Grid Signals Based on Sparse Bayesian Learning

被引:130
作者
Wu, Xiaohuan [1 ]
Zhu, Wei-Ping [2 ,3 ]
Yan, Jun [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Key Lab Broadband Wireless Commun & Sensor Networ, Nanjing 210003, Jiangsu, Peoples R China
[2] Concordia Univ, Dept Elect & Comp Engn, Montreal, PQ H3G 1M8, Canada
[3] Nanjing Univ Posts & Telecommun, Sch Commun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Direction-of-arrival (DOA) estimation; sparse signal representation (SSR); sparse Bayesian learning; covariance matrix; MAXIMUM-LIKELIHOOD; RECONSTRUCTION; RECOVERY; MUSIC;
D O I
10.1109/JSEN.2015.2508059
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The inherent limitation of the predefined spatial discrete grids greatly restricts the precision and feasibility of many sparse signal representation (SSR)-based direction-of-arrival (DOA) estimators. In this paper, we first propose a perturbed SSR-based model to alleviate this limitation by incorporating a bias parameter into the DOA estimation framework. Using this model, a perturbed sparse Bayesian learning-based algorithm, named PSBL, is developed to solve the DOA estimation problem, followed by a theoretical analysis of PSBL. We then present two algorithms based on the covariance matrix of the array output, named perturbed covariance matrix (PCM) and improved PCM (IPCM), respectively, to improve the convergence speed of PSBL. Extensive experiments show that the PSBL enjoys a high estimation accuracy in the cases of limited snapshots, low signal-to-noise-ratio, correlated, and spatially adjacent signals. In particular, PCM not only keeps the merits of PSBL, but also exhibits superiority over PSBL in terms of computational efficiency. IPCM has a better computational efficiency, but with a small sacrifice of its performance in a correlated signal scenario.
引用
收藏
页码:2004 / 2016
页数:13
相关论文
共 41 条
[1]  
[Anonymous], 1992, Array Signal Processing: Concepts and Techniques
[2]  
[Anonymous], 2006, Ph.D. dissertation
[3]   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-+
[4]  
Benesty J, 2008, SPRINGER TOP SIGN PR, V1, P1
[5]  
Chen SSB, 2001, SIAM REV, V43, P129, DOI [10.1137/S003614450037906X, 10.1137/S1064827596304010]
[6]   Sparse solutions to linear inverse problems with multiple measurement vectors [J].
Cotter, SF ;
Rao, BD ;
Engan, K ;
Kreutz-Delgado, K .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (07) :2477-2488
[7]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[8]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[9]   Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation [J].
Eldar, Yonina C. ;
Rauhut, Holger .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) :505-519
[10]   THE ROOT-MUSIC ALGORITHM FOR DIRECTION FINDING WITH INTERPOLATED ARRAYS [J].
FRIEDLANDER, B .
SIGNAL PROCESSING, 1993, 30 (01) :15-29