Grid Evolution Method for DOA Estimation

被引:58
作者
Wang, Qianli [1 ]
Zhao, Zhiqin [1 ]
Chen, Zhuming [1 ]
Nie, Zaiping [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Elect Engn, Chengdu 610054, Sichuan, Peoples R China
基金
中国国家自然科学基金;
关键词
Direction-of-arrival (DOA); off-grid; grid evolution; sparse Bayesian learning (SBL); OF-ARRIVAL ESTIMATION; SPARSE SIGNAL RECONSTRUCTION; SOURCE LOCALIZATION; PARAMETRIC APPROACH; SENSOR ARRAYS; LINEAR-ARRAY;
D O I
10.1109/TSP.2018.2814998
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Off-grid direction of arrival (OGDOA) estimation methods deal with the situations where true direction of arrivals (DOAs) are not on the discretized sampling grid. However, existing OGDOA estimation methods are faced with a tradeoff between density of initial grid and computational workload. Furthermore, these methods fail if more than one true DOA is located in a same grid interval. In order to speed up the OGDOA estimation methods and solve the problem of more than one DOA in one initial grid interval, a grid evolution direction of arrival (GEDOA) estimation method is proposed. Based on the combination of OGDOA estimation methods and grid refinement, this new approach makes the grid nonuniformly evolve from coarse to dense. The proposed method contains two subprocesses, i.e., learning process and fission process. The learning process aims to update locations of grid points and estimate DOAs. The fission process aims to generate new grid points and guarantees that there is only one DOA in a grid interval. The two processes iterate alternatively. Finally, an adaptive and nonuniform grid and an estimated spatial spectrum based on this grid are achieved. Compared with the previous methods, GEDOA has better computational efficiency because fewer grid points are used at each iteration. Furthermore, GEDOA has better resolution and lower MSE at relative high SNR. This is because that the evolved grid obtained by this new approach is information adaptive. Numerical simulations validate the effectiveness of the proposed method.
引用
收藏
页码:2374 / 2383
页数:10
相关论文
共 38 条
[1]  
[Anonymous], 1993, ESIMATION THEORY
[2]  
[Anonymous], 2013, MATH INTRO COMPRESSI
[3]  
[Anonymous], 2016, ARXIV160909596
[4]   ON THE NUMBER OF SIGNALS RESOLVABLE BY A UNIFORM LINEAR-ARRAY [J].
BRESLER, Y ;
MACOVSKI, A .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1986, 34 (06) :1361-1375
[5]   Directions-of-Arrival Estimation Through Bayesian Compressive Sensing Strategies [J].
Carlin, Matteo ;
Rocca, Paolo ;
Oliveri, Giacomo ;
Viani, Federico ;
Massa, Andrea .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2013, 61 (07) :3828-3838
[6]   Theoretical results on sparse representations of multiple-measurement vectors [J].
Chen, Jie ;
Huo, Xiaoming .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (12) :4634-4643
[7]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[8]   Root Sparse Bayesian Learning for Off-Grid DOA Estimation [J].
Dai, Jisheng ;
Bao, Xu ;
Xu, Weichao ;
Chang, Chunqi .
IEEE SIGNAL PROCESSING LETTERS, 2017, 24 (01) :46-50
[9]   Narrowband and Wideband Off-Grid Direction-of-Arrival Estimation via Sparse Bayesian Learning [J].
Das, Anup ;
Sejnowski, Terrence J. .
IEEE JOURNAL OF OCEANIC ENGINEERING, 2018, 43 (01) :108-118
[10]   Rank Awareness in Joint Sparse Recovery [J].
Davies, Mike E. ;
Eldar, Yonina C. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (02) :1135-1146