Frequency estimation

From Wikipedia, the free encyclopedia

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]. 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, x(n), consisting of a sum of p complex exponentials,

A_i = |A_i|,e^{j\phi_i},

in the presence of white noise, w(n). This may be represented as

f(x) = \sum_{i=1}^p A_i e^{j n \omega_i} + w(n).

Thus, the power spectrum of x(n) consists of p 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.

Contents

Pisarenko's Method

\hat P_{PHD}(e^{j \omega}) = \frac{1}{|\mathbf{e}^{H}\mathbf{v}_{min}|^2}

MUSIC

\hat P_{MU}(e^{j \omega}) = \frac{1}{\sum_{i=p+1}^{M} |\mathbf{e}^{H} \mathbf{v}_i|^2},

Eigenvector Method

\hat P_{EV}(e^{j \omega}) = \frac{1}{\sum_{i=p+1}^{M}\frac{1}{\lambda_i} |\mathbf{e}^H \mathbf{v}_i|^2}

Minimum Norm

\hat P_{MN}(e^{j \omega}) = \frac{1}{|\mathbf{e}^H \mathbf{a}|^2} ; \mathbf{a} = \lambda \mathbf{P}_n \mathbf{u}_1

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.

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

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.