Low-Complexity DOA Estimation Algorithm based on Real-Valued Sparse Bayesian Learning

The present DOA estimation approach based on sparse Bayesian learning has two major shortcomings: high algorithm complexity and large estimate errors. These two flaws are mostly the result of an excessive number of complex-valued matrix inversion operations and incorrect grid partitioning in the EM...

Full description

Saved in:
Bibliographic Details
Published inCircuits, systems, and signal processing Vol. 43; no. 7; pp. 4319 - 4338
Main Authors Wang, Guan, Kang, Yong, Wang, Hui
Format Journal Article
LanguageEnglish
Published New York Springer US 01.07.2024
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0278-081X
1531-5878
DOI10.1007/s00034-024-02649-7

Cover

More Information
Summary:The present DOA estimation approach based on sparse Bayesian learning has two major shortcomings: high algorithm complexity and large estimate errors. These two flaws are mostly the result of an excessive number of complex-valued matrix inversion operations and incorrect grid partitioning in the EM stage of sparse Bayesian learning (SBL). To overcome the aforementioned issues, we propose a three-procedure, low-complexity DOA estimate technique based on SBL. First, the roots of the estimated covariance are used to complete the real-valued conversion and generate the received signal matrix, which includes the virtual array steering vector. Second, a novel iterative method for immobile spots is devised using the probability distribution function of the noise variance. Finally, iterations are completed utilizing dynamic grid approaches to improve DOA estimation accuracy. The simulation findings reveal that the proposed technique significantly speeds up DOA estimation and, to a lesser extent, improves estimation accuracy.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0278-081X
1531-5878
DOI:10.1007/s00034-024-02649-7