Abstract

This paper presents a novel mixed source localization algorithm based on high-order cumulant (HOC) and oblique projection techniques. To address the issue of lower accuracy in near-field source (NFS) localization compared to the far-field source (FFS) localization, the presented algorithm further enhances the accuracy of NFS localization. First, the FFS’s direction-of-arrival (DOA) estimate is acquired utilizing a multiple signal classification (MUSIC) spectral peak search. To classify mixed sources more effectively, we utilize the oblique projection technique, which can successfully prevent FFS information from influencing the estimation of NFS parameters. A HOC matrix with solely NFS DOA information is built by choosing array elements in a specific sequence. The estimation of the NFS DOA is then derived using the estimation of signal parameters via a rotational invariance technique (ESPRIT)-like algorithm. Finally, the NFS range is acquired by a MUSIC search. The performance of the presented algorithm is discussed in several aspects. Compared to existing matrix difference methods, the presented algorithm, which adopts the oblique projection method, achieves superior results in the separation of mixed sources. Without excessively increasing the computational complexity, it not only ensures the performance of localization parameter estimation for FFS but also estimates the NFS with higher precision. The numerical simulations attest to the superior performance of the presented algorithm.

Full Text
Paper version not known

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.