# MUSIC (algorithm)

(Redirected from Multiple signal classification)

MUSIC (MUltiple SIgnal Classification) is an algorithm used for frequency estimation[1] and emitter location.[2]

## MUSIC algorithm

In many practical signal processing problems, the objective is to estimate from measurements a set of constant parameters upon which the received signals depend. There have been several approaches to such problems including the so-called maximum likelihood (ML) method of Capon (1969) and Burg's maximum entropy (ME) method. Although often successful and widely used, these methods have certain fundamental limitations (especially bias and sensitivity in parameter estimates), largely because they use an incorrect model (e.g., AR rather than special ARMA) of the measurements. Pisarenko (1973) was one of the first to exploit the structure of the data model, doing so in the context of estimation of parameters of complex sinusoids in additive noise using a covariance approach. Schmidt (1977), while working at of Northrop Grumman) and independently (1979) were the first to correctly exploit the measurement model in the case of sensor arrays of arbitrary form. Schmidt, in particular, accomplished this by first deriving a complete geometric solution in the absence of noise, then cleverly extending the geometric concepts to obtain a reasonable approximate solution in the presence of noise. The resulting algorithm was called MUSIC (MUltiple SIgnal Classification) and has been widely studied. In a detailed evaluation based on thousands of simulations, the Massachusetts Institute of Technology's Lincoln Laboratory concluded that, among currently accepted high-resolution algorithms, MUSIC was the most promising and a leading candidate for further study and actual hardware implementation[3]. However, although the performance advantages of MUSIC are substantial, they are achieved at a cost in computation (searching over parameter space) and storage (of array calibration data).[4]

## Application to frequency estimation

MUSIC estimates the frequency content of a signal or autocorrelation matrix using an eigenspace method. This method assumes that a signal, ${\displaystyle x(n)}$, consists of ${\displaystyle p}$ complex exponentials in the presence of Gaussian white noise. Given an ${\displaystyle M\times M}$ autocorrelation matrix, ${\displaystyle \mathbf {R} _{x}}$, if the eigenvalues are sorted in decreasing order, the eigenvectors corresponding to the ${\displaystyle p}$ largest eigenvalues (i.e. directions of largest variability) span the signal subspace. The remaining ${\displaystyle M-p}$ eigenvectors span the orthogonal space, where there is only noise. Note that for ${\displaystyle M=p+1}$, MUSIC is identical to Pisarenko harmonic decomposition. The general idea is to use averaging to improve the performance of the Pisarenko estimator.

The frequency estimation function for MUSIC is

${\displaystyle {\hat {P}}_{MU}(e^{j\omega })={\frac {1}{\sum _{i=p+1}^{M}|\mathbf {e} ^{H}\mathbf {v} _{i}|^{2}}},}$

where ${\displaystyle \mathbf {v} _{i}}$ are the noise eigenvectors and

${\displaystyle \mathbf {e} ={\begin{bmatrix}1&e^{j\omega }&e^{j2\omega }&\cdots &e^{j(M-1)\omega }\end{bmatrix}}^{T}.}$

The locations of the ${\displaystyle p}$ largest peaks of the estimation function give the frequency estimates for the ${\displaystyle p}$ signal components.

MUSIC is a generalization and computationalization of Pisarenko's method. In Pisarenko, only a single eigenvector is used and taken to be a set of autoregressive coefficients, whose zeros can be found analytically or with polynomial root finding algorithms. In contrast, MUSIC assumes that several such functions have been added together, so zeros may not be present. Instead there are local minima, which can be located by computationally searching the estimation function for peaks.

## Comparison to other methods

MUSIC outperforms simple methods such as picking peaks of DFT spectra in the presence of noise, when the number of components is known in advance, because it exploits knowledge of this number to ignore the noise in its final report.

Unlike DFT, it is able to estimate frequencies with accuracy higher than one sample, because its estimation function can be evaluated for any frequency, not just those of DFT bins. This is a form of superresolution.

Its chief disadvantage is that it requires the number of components to be known in advance, so the original method cannot be used in more general cases. Methods exist for estimating the number of source components purely from statistical properties of the autocorrelation matrix. See, e.g. [5] In addition, MUSIC assumes coexistent sources to be uncorrelated, which limits its practical applications.

Recent iterative semi-parametric methods offer robust superresolution despite of highly correlated sources, e.g., SAMV[6][7]

## History

MUSIC was originated by R. O. Schmidt in 1979 as an improvement to Pisarenko's method.

## Applications of MUSIC

A modified version of MUSIC, denoted as Time-Reversal MUSIC (TR-MUSIC) has been recently applied to computational time-reversal imaging.[8][9]

## References

1. ^ Hayes, Monson H., Statistical Digital Signal Processing and Modeling, John Wiley & Sons, Inc., 1996. ISBN 0-471-59431-8.
2. ^ Schmidt, R.O, "Multiple Emitter Location and Signal Parameter Estimation," IEEE Trans. Antennas Propagation, Vol. AP-34 (March 1986), pp.276-280.
3. ^ Barabell, A. J. (1998). "Performance Comparison of Superresolution Array Processing Algorithms. Revised". MASSACHUSETTS INST OF TECH LEXINGTON LINCOLN LAB.
4. ^ R. Roy and T. Kailath, "ESPRIT-estimation of signal parameters via rotational invariance techniques," in IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 37, no. 7, pp. 984-995, Jul 1989.
5. ^ Fishler, Eran, and H. Vincent Poor. "Estimation of the number of sources in unbalanced arrays via information theoretic criteria." IEEE Transactions on Signal Processing 53.9 (2005): 3543-3553.
6. ^ Abeida, Habti; Zhang, Qilin; Li, Jian; Merabtine, Nadjim (2013). "Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing". IEEE Transactions on Signal Processing. Institute of Electrical and Electronics Engineers (IEEE). 61 (4): 933–944. doi:10.1109/tsp.2012.2231676. ISSN 1053-587X.
7. ^ Zhang, Qilin; Abeida, Habti; Xue, Ming; Rowe, William; Li, Jian (2012). "Fast implementation of sparse iterative covariance-based estimation for source localization". The Journal of the Acoustical Society of America. 131 (2). doi:10.1121/1.3672656.
8. ^ Devaney, A.J. (2005-05-01). "Time reversal imaging of obscured targets from multistatic data". IEEE Transactions on Antennas and Propagation. 53 (5): 1600–1610. doi:10.1109/TAP.2005.846723. ISSN 0018-926X.
9. ^ Ciuonzo, D.; Romano, G.; Solimene, R. (2015-05-01). "Performance Analysis of Time-Reversal MUSIC". IEEE Transactions on Signal Processing. 63 (10): 2650–2662. doi:10.1109/TSP.2015.2417507. ISSN 1053-587X.