Abstract
AbstractCompared with the traditional two‐step localization methods, the direct position determination (DPD) method is more robust at low signal‐to‐noise ratio. However, to guarantee the optimal location result, the computational complexity of DPD with grid search is too high, especially for moving targets. Therefore, a new DPD method is proposed for moving targets with low computational complexity. First, using a proposed cost function, the position information is obtained from the received array signals directly, which enhances the accuracy of localization. Second, utilizing the method of successional difference the velocity is extracted, which avoid the multi‐dimensional grid search and reduces the computational complexity. Simulation results demonstrate that the proposed method reduces the computational complexity greatly and outperforms the conventional methods.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
