Statistical analysis of decentralized MUSIC

For large-array processing problems there is a need for decentralized methods that are computationally efficient. A decentralized variant of the MUSIC algorithm, proposed in the literature, is here analysed from a statistical viewpoint, assuming that a large number of snapshots is available. As intuitively expected, the centralized MUSIC algorithm is more accurate than both the local and decentralized versions of MUSIC. More surprisingly, the decentralized variant of MUSIC is not always more accurate than the local MUSIC estimates. The theoretical analysis is supported by numerical examples.

[1]  Thomas Kailath,et al.  Detection of signals by information theoretic criteria , 1985, IEEE Trans. Acoust. Speech Signal Process..

[2]  Petre Stoica,et al.  MUSIC, maximum likelihood, and Cramer-Rao bound: further results and comparisons , 1990, IEEE Trans. Acoust. Speech Signal Process..

[3]  Petre Stoica,et al.  Maximum likelihood methods for direction-of-arrival estimation , 1990, IEEE Trans. Acoust. Speech Signal Process..

[4]  Petre Stoica,et al.  Decentralized Control , 2018, The Control Systems Handbook.

[5]  B Ottersten,et al.  Parametric subspace fitting methods for array signal processing , 1990 .

[6]  Rangasami L. Kashyap,et al.  Robust decentralized direction-of-arrival estimation in contaminated noise , 1990, IEEE Trans. Acoust. Speech Signal Process..

[7]  Mats Viberg,et al.  Subspace fitting concepts in sensor array processing , 1990 .

[8]  Thomas Kailath,et al.  Decentralized processing in sensor arrays , 1985, IEEE Trans. Acoust. Speech Signal Process..

[9]  Petre Stoica,et al.  MUSIC, maximum likelihood, and Cramer-Rao bound , 1989, IEEE Transactions on Acoustics, Speech, and Signal Processing.

[10]  Ralph Otto Schmidt,et al.  A signal subspace approach to multiple emitter location and spectral estimation , 1981 .