Abstract

In this study, an off-grid sparse Bayesian inference (OGSBI) based direct position determination (DPD) algorithm is investigated. Existing SBI-based DPD algorithms are confronted with the challenge of excessive computational loads and lack of consideration for non-circular (NC) signals. To address these limitations, we present an enhanced OGSBI-based DPD algorithm for multiple non-circular sources. By utilizing the conjugate information of the NC signals, we expand the dimensionality of the data matrix to achieve a significant improvement in the localization performance. Additionally, a grid refinement strategy is developed to alleviate the computational loads, which involves an initial search to determine the approximate source locations, followed by fine localization using a denser grid. Moreover, the computational complexity and Cramér-Rao lower bound are derived to provide a comprehensive analysis of the proposed algorithm. Numerical simulations demonstrate the superiority of the proposed algorithm in terms of both localization accuracy and computational efficiency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call