Joint Detection and Localization of an Unknown Number of Sources Using the Algebraic Structure of the Noise Subspace

Source localization and spectral estimation are among the most fundamental problems in statistical and array signal processing. Methods that rely on the orthogonality of the signal and noise subspaces, such as Pisarenko's method, MUSIC, and root-MUSIC, are some of the most widely used algorithms to solve these problems. As a common feature, these methods require both a priori knowledge of the number of sources and an estimate of the noise subspace. Both requirements are complicating factors to the practical implementation of the algorithms and, when not satisfied exactly, can potentially lead to severe errors. In this paper, we propose a new localization criterion based on the algebraic structure of the noise subspace that is described for the first time to the best of our knowledge. Using this criterion and the relationship between the source localization problem and the problem of computing the greatest common divisor (GCD), or more practically approximate GCD, for polynomials, we propose two algorithms, which adaptively learn the number of sources and estimate their locations. Simulation results show a significant improvement over root-MUSIC in challenging scenarios such as closely located sources, both in terms of detection of the number of sources and their localization over a broad and practical range of signal-to-noise ratios. Furthermore, no performance sacrifice in simple scenarios is observed.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Sergiy A. Vorobyov,et al.  Subspace Leakage Analysis and Improved DOA Estimation With Small Sample Size , 2015, IEEE Transactions on Signal Processing.

[3]  V. Pan.  Numerical Computation of a Polynomial GCD and Extensions , 1996 .

[4]  R. O. Schmidt,et al.  Multiple emitter location and signal Parameter estimation , 1986 .

[5]  John K. Thomas,et al.  The probability of a subspace swap in the SVD , 1995, IEEE Trans. Signal Process..

[6]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[7]  Geert Leus,et al.  An ideal-theoretic criterion for localization of an unknown number of sources , 2016, 2016 50th Asilomar Conference on Signals, Systems and Computers.

[8]  Ė. B. Vinberg,et al.  A course in algebra , 2003 .

[9]  H. B. Griffiths.  CAYLEY'S VERSION OF THE RESULTANT OF TWO POLYNOMIALS , 1981 .

[10]  Grigoriy Blekherman,et al.  Nonnegative Polynomials and Sums of Squares , 2010, 1010.3465.

[11]  Bhaskar D. Rao,et al.  Performance analysis of Root-Music , 1989, IEEE Trans. Acoust. Speech Signal Process..

[12]  Narendra Karmarkar,et al.  On Approximate GCDs of Univariate Polynomials , 1998, J. Symb. Comput..

[13]  Xiaomei Yang.  Rounding Errors in Algebraic Processes , 1964, Nature.

[14]  Martin Kreuzer,et al.  Computational Commutative Algebra 1 , 2000 .

[15]  M. Kaveh,et al.  Practical detection with calibrated arrays , 1992, [1992] IEEE Sixth SP Workshop on Statistical Signal and Array Processing.

[16]  Sergiy A. Vorobyov,et al.  An Algebraic Approach to a Class of Rank-Constrained Semi-Definite Programs With Applications , 2016, ArXiv.

[17]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves I: simple intersections , 1994, TOGS.

[18]  Abdelhak M. Zoubir,et al.  Detection of sources using bootstrap techniques , 2002, IEEE Trans. Signal Process..

[19]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[20]  Marc Arnaudon,et al.  Medians and Means in Riemannian Geometry: Existence, Uniqueness and Computation , 2011, 1111.3120.

[21]  Petre Stoica,et al.  Spectral Analysis of Signals , 2009 .

[22]  Zhonggang Zeng,et al.  The numerical greatest common divisor of univariate polynomials , 2021, ArXiv.

[23]  A. Nikeghbali,et al.  The zeros of random polynomials cluster uniformly near the unit circle , 2004, Compositio Mathematica.

[24]  Visa Koivunen,et al.  Robust antenna array processing using M-estimators of pseudo-covariance , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[25]  Zhonggang Zeng,et al.  The approximate GCD of inexact polynomials Part II: a multivariate algorithm , 2004, ISSAC 2004.