It is interesting to determine the number of signals impinging upon a large array with small samples. We tackle this problem by using linear shrinkage coefficients of signal and noise subspaces, ending up with two shrinkage coefficient-based detectors (SCDs) for source enumeration. It is proved that the noise shrinkage coefficients are asymptotically Gaussian distributed as the number of antennas and number of samples tend to infinity at the same rate. Moreover, the noise shrinkage coefficients almost surely converge to one while the signal shrinkage coefficients are almost surely less than one as m,n→,∞ and m/n→c.With these properties, the threshold-like and heuristic SCD algorithms for source number detection are devised. Simulation results are included to illustrate their effectiveness.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Source enumeration for large array using shrinkage-based detectors with small samples


    Contributors:
    Lei Huang, (author) / Cheng Qian, (author) / Hing Cheung So, (author) / Jun Fang, (author)


    Publication date :

    2015-01-01


    Size :

    1552435 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English