2-D DOA Estimation Based on Sparse Bayesian Learning for L-Shaped Nested Array

Lu CHEN  Daping BI  Jifei PAN  

IEICE TRANSACTIONS on Communications   Vol.E102-B   No.5   pp.992-999
Publication Date: 2019/05/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2018EBP3232
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
two-dimensional direction finding,  nested array,  sparse Bayesian learning,  matrix decomposition,  complexity reduction,  

Full Text: PDF(1.3MB)>>
Buy this Article

In sparsity-based optimization problems for two dimensional (2-D) direction-of-arrival (DOA) estimation using L-shaped nested arrays, one of the major issues is computational complexity. A 2-D DOA estimation algorithm is proposed based on reconsitution sparse Bayesian learning (RSBL) and cross covariance matrix decomposition. A single measurement vector (SMV) model is obtained by the difference coarray corresponding to one-dimensional nested array. Through spatial smoothing, the signal measurement vector is transformed into a multiple measurement vector (MMV) matrix. The signal matrix is separated by singular values decomposition (SVD) of the matrix. Using this method, the dimensionality of the sensing matrix and data size can be reduced. The sparse Bayesian learning algorithm is used to estimate one-dimensional angles. By using the one-dimensional angle estimations, the steering vector matrix is reconstructed. The cross covariance matrix of two dimensions is decomposed and transformed. Then the closed expression of the steering vector matrix of another dimension is derived, and the angles are estimated. Automatic pairing can be achieved in two dimensions. Through the proposed algorithm, the 2-D search problem is transformed into a one-dimensional search problem and a matrix transformation problem. Simulations show that the proposed algorithm has better angle estimation accuracy than the traditional two-dimensional direction finding algorithm at low signal-to-noise ratio and few samples.