On the asymptotic resolvability of two point sources in known subspace interference using a GLRT-based framework

The asymptotic statistical resolution limit (SRL), denoted by @d, characterizing the minimal separation to resolve two closely spaced far-field narrowband sources for a large number of observations, among a total number of M>=2, impinging on a linear array is derived. The two sources of interest (SOI) are corrupted by (1) the interference resulting from the M-2 remaining sources and by (2) a broadband noise. Toward this end, a hypothesis test formulation is conducted. Depending on the a priori knowledge on the SOI, on the interfering sources and on the noise variance, the (constrained) maximum likelihood estimators (MLEs) of the SRL subject to @[email protected]?R and/or in the context of the matched subspace detector theory are derived. Finally, we show that the SRL which is the minimum separation that allows a correct resolvability for given probabilities of false alarm and of detection can always be linked to a particular form of the Cramer-Rao bound (CRB), called the interference CRB (I-CRB), which takes into account the M-2 interfering sources. As a by product, we give the theoretical expression of the minimum signal-to-interference-plus-noise ratio (SINR) required to resolve two closely spaced sources for several typical scenarios.

[1]  L. Scharf,et al.  Statistical Signal Processing: Detection, Estimation, and Time Series Analysis , 1991 .

[2]  Harry L. Van Trees,et al.  Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory , 2002 .

[3]  Mohammed Nabil El Korso,et al.  Statistical resolution limit for the multidimensional harmonic retrieval model: hypothesis test and Cramér-Rao Bound approaches , 2011, EURASIP J. Adv. Signal Process..

[4]  H. V. Trees Detection, Estimation, And Modulation Theory , 2001 .

[5]  Yuri I. Abramovich,et al.  Statistical nonidentifiability of close emitters: Maximum-likelihood estimation breakdown , 2009, 2009 17th European Signal Processing Conference.

[6]  H. B. Lee,et al.  The Cramer-Rao bound on frequency estimates of signals closely spaced in frequency (unconditional case) , 1994, IEEE Trans. Signal Process..

[7]  M. Viberg,et al.  Two decades of array signal processing research: the parametric approach , 1996, IEEE Signal Process. Mag..

[8]  Harry B. Lee,et al.  The Cramer-Rao bound on frequency estimates of signals closely spaced in frequency , 1992, IEEE Trans. Signal Process..

[9]  Erdogan Dilaveroglu,et al.  Nonmatrix Cramer-Rao bound expressions for high-resolution frequency estimators , 1998, IEEE Trans. Signal Process..

[10]  S.T. Smith Statistical Resolution Limits and the Complexified , 2005 .

[11]  Louis L. Scharf,et al.  Signal processing applications of oblique projection operators , 1994, IEEE Trans. Signal Process..

[12]  H. Cox Resolving power and sensitivity to mismatch of optimum array processors , 1973 .

[13]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[14]  S. T. Smith Statistical resolution limits and the complexified Crame/spl acute/r-Rao bound , 2005, IEEE Transactions on Signal Processing.

[15]  Peyman Milanfar,et al.  Statistical and Information-Theoretic Analysis of Resolution in Imaging , 2006, IEEE Transactions on Information Theory.

[16]  Zhi Liu,et al.  Statistical Angular Resolution Limit for Point Sources , 2007, IEEE Transactions on Signal Processing.

[17]  Peyman Milanfar,et al.  Imaging below the diffraction limit: a statistical analysis , 2004, IEEE Transactions on Image Processing.

[18]  Rémy Boyer,et al.  Oblique projection for source estimation in a competitive environment: Algorithm and statistical analysis , 2009, Signal Process..

[19]  Jean Pierre Delmas,et al.  Bounds for sparse planar and volume arrays , 2001, IEEE Trans. Inf. Theory.

[20]  Journal of the Optical Society of America , 1950, Nature.

[21]  Louis L. Scharf,et al.  Matched subspace detectors , 1994, IEEE Trans. Signal Process..

[22]  Richard Travis Behrens Subspace signal processing structured noise , 1991 .

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

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

[25]  Petre Stoica,et al.  On the resolution performance of spectral analysis , 1995, Signal Process..

[26]  Bjorn Ottersten,et al.  Exact and Large Sample ML Techniques for Parameter Estimation and Detection in Array Processing , 1993 .

[27]  Adriaan van den Bos,et al.  Resolution: a survey , 1997 .

[28]  S. Kay Fundamentals of statistical signal processing: estimation theory , 1993 .

[29]  Edward J. Wegman,et al.  Statistical Signal Processing , 1985 .

[30]  Anthony J. Weiss,et al.  Fundamental Limitations on the Resolution of Deterministic Signals , 2008, IEEE Transactions on Signal Processing.

[31]  Tariq S. Durrani,et al.  Resolving power of signal subspace methods for finite data lengths , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[32]  Peyman Milanfar,et al.  On the resolvability of sinusoids with nearby frequencies in the presence of noise , 2005, IEEE Transactions on Signal Processing.

[33]  Alexei Gorokhov,et al.  Positive-definite Toeplitz completion in DOA estimation for nonuniform linear antenna arrays. II. Partially augmentable arrays , 1998, IEEE Transactions on Signal Processing.