Coarrays, MUSIC, and the Cram\'er Rao Bound
Mianzhi Wang, Arye Nehorai

TL;DR
This paper provides a theoretical analysis of the MUSIC algorithm applied to coarray-based sparse linear arrays, deriving asymptotic MSE expressions, the Cramér-Rao bound, and explaining high SNR saturation effects.
Contribution
It introduces a simplified asymptotic MSE expression for coarray MUSIC, compares covariance matrix methods, and derives the CRB for sparse arrays, advancing understanding of performance limits.
Findings
MSE converges to a positive value at high SNR with more sources than sensors.
Augmented and spatially smoothed covariance matrices yield the same asymptotic MSE.
Experimental results confirm theoretical predictions and reveal efficiency patterns.
Abstract
Sparse linear arrays, such as co-prime arrays and nested arrays, have the attractive capability of providing enhanced degrees of freedom. By exploiting the coarray structure, an augmented sample covariance matrix can be constructed and MUSIC (MUtiple SIgnal Classification) can be applied to identify more sources than the number of sensors. While such a MUSIC algorithm works quite well, its performance has not been theoretically analyzed. In this paper, we derive a simplified asymptotic mean square error (MSE) expression for the MUSIC algorithm applied to the coarray model, which is applicable even if the source number exceeds the sensor number. We show that the directly augmented sample covariance matrix and the spatial smoothed sample covariance matrix yield the same asymptotic MSE for MUSIC. We also show that when there are more sources than the number of sensors, the MSE converges to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
