# Frequency estimation

*This article is about the technique in signal processing. The term "frequency estimation" can also refer to probability estimation.*

**Frequency estimation** is the process of estimating the complex frequency components of a signal in the presence of noise^{[1]}, given assumptions about the number of the components. (This contrasts with spectral density estimation which does not make prior assumptions about the components.)

The most common methods involve identifying the noise subspace to extract these components. The most popular methods of noise subspace based frequency estimation are Pisarenko's Method, MUSIC, the eigenvector solution, and the minimum norm solution.

For example, consider a signal, , consisting of a sum of complex exponentials in the presence of white noise, . This may be represented as

Thus, the power spectrum of consists of impulses in addition to the power due to noise.

The noise subspace methods of frequency estimation are based on eigen decomposition of the autocorrelation matrix into a signal subspace and a noise subspace. After these subspaces are identified, a frequency estimation function is used to find the component frequencies from the noise subspace.

## Methods of frequency estimation

Eigenvector Method

Minimum Norm

## Related techniques

If one only wants to estimate the single loudest frequency, one can use a pitch detection algorithm.

If one wants to know *all* the (possibly complex) frequency components of a received signal (including transmitted signal and noise), one uses a discrete Fourier transform or some other Fourier-related transform.

## See also

## References

- ↑ Hayes, Monson H.,
*Statistical Digital Signal Processing and Modeling*, John Wiley & Sons, Inc., 1996. ISBN 0-471-59431-8.