Off‐grid fast relevance vector machine algorithm for direction of arrival estimation. Issue 4 (1st April 2016)

• Record Type: Journal Article
• Authors: Lin, Jincheng; Ma, Xiaochuan; Yan, Shefeng; Hao, Chengpeng; Lin, Geping
• Is Part Of: IET radar, sonar & navigation. Volume 10:Issue 4(2016)
• Page Start: 718
• Page End: 725
• Publication Date: 2016-04-01
• Subjects: direction‐of‐arrival estimation -- Bayes methods -- compressed sensing -- iterative methods -- learning (artificial intelligence); off‐grid fast relevance vector machine algorithm -- direction of arrival estimation -- DOA estimation -- signal processing -- Bayesian compressive sensing -- BCS method -- iterative algorithm -- OG model -- multiple‐snapshot case -- single‐snapshot case -- penalisation method -- Cramer‐Rao bound; Signal processing -- Periodicals; Radar -- Periodicals; Sonar -- Periodicals; Electronics in navigation -- Periodicals; Navigation -- Periodicals; 621.3848
• DOI: 10.1049/iet-rsn.2015.0304
• Languages: English
• ISSNs: 1751-8784

Abstract

Abstract : Direction of arrival (DOA) estimation is a basic and important problem in signal processing and has been widely applied. Its research has been advanced by the recently developed methods based on Bayesian compressive sensing (BCS). Among these methods, the ones combined with an off‐grid (OG) model have been proved to be more accurate than the on‐grid ones. However, the conventional BCS‐based methods have a disadvantage of the slow speed. In this study, a high‐efficiency iterative algorithm, based on the fast relevance vector machine and the OG model, is developed. This new approach applies to both the single‐ and multiple‐snapshot cases. Numerical simulations show that the proposed method estimates DOAs more accurately than the ℓ1 ‐penalisation method and computes more efficiently than the conventional BCS‐based methods. Finally, comparisons with state‐of‐the‐art methods and Cramer–Rao bound are also reported.