A Generalized Propagator Algorithm for Localization of Non-circular Sources Using Arbitrary Array Geometry

• Published in: Transactions of Nanjing University of Aeronautics & Astronautics Vol. 36; no. 2; pp. 339 - 351
• Main Authors: Cao, Renzheng, Zhang, Xiaofei
• Format: Journal Article
• Language: Chinese; English
• Published: Nanjing Nanjing University of Aeronautics and Astronautics 01.01.2019; College of Electronic and Information Engineering,Nanjing University of Aeronautics and Astronautics, Nanjing 211106,P. R. China%College of Electronic and Information Engineering,Nanjing University of Aeronautics and Astronautics, Nanjing 211106,P. R. China; The 28th Research Institute,China Electronics Technology Group Corporation,Nanjing 210007,P. R. China
• Subjects: Algorithms; Amplitude modulation; Apertures; Arrays; Binary phase shift keying; Circularity; Computer simulation; Direction of arrival; Polynomials; rank reduction criterion; propagator; subspace method; non?circular source; direction of arrival (DOA)
• ISSN: 1005-1120

A propagator-based algorithm for direction of arrival(DOA)estimation of noncoherent one-dimensional(1-D) non-circular sources is presented such as binary phase shift keying(BPSK) and amplitude modulation(AM). The algorithm achieves DOA estimation through searching a 1-D spectrum,which is newly formed on the basis of the rank reduction criterion,and works well without knowledge of the non-circular phases. And then,a searchfree implementation of the algorithm is also developed by using the polynomial rooting technique. According to the noncircular property,the algorithm can virtually enlarge the array aperture,thus significantly improving its estimation accuracy and enabling it to handle more sources than the number of sensors. Moreover,the algorithm requires no rotational invariance,so it can be applied to arbitrary array geometry and dispense with the high-complexity procedure of the eigen-decomposition of the correlation sample matrix. Finally,numerical simulations verify the performance and effectiveness of the proposed algorithm.