Enumeration for a Large Number of Sources Based on a Two-Step Difference Operation of Linear Shrinkage Coefficients.

Anovel and computationally efficient source enumeration algorithm is proposed for large-scale arrays with a small number of samples, by employing a two-step difference operation of linear shrinkage (LS) coefficients of sample covariance matrix (SCM) in large-dimensional scenarios. It is firstly proved that the difference between noise LS coefficients tends to zero and there exists a clear gap between the last signal LS coefficient (alpha) over cap ((d-1)) and the first noise LS coefficient (alpha) over cap ((d)) in relatively high signal-to-noise ratio (SNR) cases for m, n ->infinity and m/n. c.is an element of(0,infinity), where m, n and d are the antenna number, sample number and source signal number, respectively. With this property, the first-step difference operation is designed to achieve initial source enumeration. Further considering relatively low ormedium SNRs, the second step yields an improved estimation result and is capable of estimating a large number of sources. Furthermore, the applicability of the representative LS coefficients based SCDheur algorithm under various values of c is analyzed, and amore general condition for guaranteeing its effectiveness is provided. Simulation results