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

被引:0
|
作者
Chen, Lu [1 ]
Bi, Daping [1 ]
Pan, Jifei [1 ]
机构
[1] Natl Univ Def Technol, Hefei, Anhui, Peoples R China
关键词
two-dimensional direction finding; nested array; sparse Bayesian learning; matrix decomposition; complexity reduction; ANGLE ESTIMATION; OF-ARRIVAL; SVD;
D O I
10.1587/transcom.2018EBP3232
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:992 / 999
页数:8
相关论文
共 50 条
  • [21] An Efficient 2-D DOA Estimation Method for Unfolded Coprime L-Shaped Array
    Zhang, Qiting
    Li, Jianfeng
    Tang, Yawei
    Deng, Weiming
    Zhang, Xiaofei
    Wu, Qihui
    IEEE SYSTEMS JOURNAL, 2023, 17 (02): : 3328 - 3331
  • [22] A 2-D DOA Estimation Algorithm for Closely Spaced Sources with L-Shaped Array
    Nie Xi
    Qian Guobing
    Xie Xianbing
    Zeng Kai
    Zhang Kesheng
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2017, 36 (11) : 4498 - 4511
  • [23] A 2-D DOA Estimation Algorithm for L-Shaped Array with Improved Computational Efficiency
    Yang, Jie
    He, Hu
    PROGRESS IN ELECTROMAGNETICS RESEARCH M, 2022, 112 : 115 - 125
  • [24] A Computationally Efficient Subspace Algorithm for 2-D DOA Estimation with L-shaped Array
    Nie Xi
    Li Liping
    IEEE SIGNAL PROCESSING LETTERS, 2014, 21 (08) : 971 - 974
  • [25] A 2-D DOA Estimation Algorithm for Closely Spaced Sources with L-Shaped Array
    Nie Xi
    Qian Guobing
    Xie Xianbing
    Zeng Kai
    Zhang Kesheng
    Circuits, Systems, and Signal Processing, 2017, 36 : 4498 - 4511
  • [26] 2-D DOA Estimation With Imperfect L-Shaped Array Using Active Calibration
    Liu, Shiyan
    Zhang, Zhi
    Guo, Yu
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (04) : 1178 - 1182
  • [27] Sparse-reconstruction-based 2-D angle of arrival estimation with L-shaped array
    Tian, Ye
    Lian, Qiusheng
    Xu, He
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2017, 72 : 162 - 165
  • [28] SBL-Based 2-D DOA Estimation for L-Shaped Array With Unknown Mutual Coupling
    Xiong, Xiangxiang
    Zhang, Ming
    Shi, Hongyu
    Zhang, Anxue
    Xu, Zhuo
    IEEE ACCESS, 2021, 9 : 70071 - 70079
  • [29] L-Shaped Array-based 2-D DOA Estimation Using Parallel Factor Analysis
    Liu, Ding
    Liang, Junli
    2010 8TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2010, : 6949 - 6952
  • [30] 2D DOA estimation for noncircular sources using L-shaped sparse array
    Liu, Sheng
    Yang, Lisheng
    Li, Dong
    Cao, Hailin
    Jiang, Qingping
    MULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSING, 2018, 29 (02) : 489 - 502