Abstract

It has been shown that direct target localization in distributed multiple input multiple output (MIMO) radar can outperform indirect localization significantly, but conventional direct localization methods suffer from both high computational complexity and high communication cost. In this work, we address the issues by designing an efficient factor graph based message passing approach to direct localization, which greatly reduces the computational complexity and communication cost. First, a factor graph representation for the problem of direct localization is developed, which, however, involves difficult local functions. Inspired by expectation propagation (EP), we design an iterative method to solve the problem, where both EP and belief propagation (BP) are used to make message passing in the factor graph tractable, leading to a low complexity message passing iterative method. We show that the message passing based method are very suitable for decentralized processing and can be employed in distributed radars with different configurations. Extensive comparisons with state-of-the-art indirect and direct methods are provided, which show that the proposed method can achieve similar performance to the exhaustive search-based direct localization methods while with much lower computational complexity and communication cost, and it outperforms significantly indirect localization methods at low signal to noise ratios.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.