Jump to content

User:Mygskr/WienerKhinchin

From Wikipedia, the free encyclopedia

In statistical signal processing, the Wiener–Khinchin theorem (also known as the Einstein-Wiener–Khinchin theorem or the Khinchin–Kolmogorov theorem) states that the power spectral density of a wide-sense-stationary random process is equal to the Fourier transform of the its autocorrelation function.[1][2][3][4]

Theorem

[edit]

Any wide-sense stationary random process has an autocorrelation function given by

where is the expectation over the This function captures the statistical dependence between the realization of the process at different times. However, a realization of a wide-sense-stationary random process cannot be integrable, and thus does not possess a Fourier transform [citation needed]. However, it is possible to capture the frequency content of the signal using the power spectral density. Consider a Fourier transform of truncated outside of the range :

.

Then the power spectral density of is given by the limit

The Wiener-Khinchin theorem states that

.

In other words, the power spectral density of is the Fourier transform of its autocorrelation function.

History

[edit]

Einstein first derived this result in a paper published in 1914[5]. He never again returned to the study of time series, and his work was forgotten. Norbert Wiener published a similar result in 1930, and Khinchin (sometimes spelled Khintchine) independently later in 1934, and the result came to be known as the Wiener-Khinchin theorem. The three scientists used different techniques to obtain the same fundamental result: that the power of a stationary signal contained in a frequency band can be found by integrating the Fourier transform of the autocorrelation over that band. Since modern sources typically define the power spectral density as the Fourier transform of the autocorrelation, the significance of the theorem is not always appreciated.

Discrete version

[edit]

A discrete version of the theorem states that the power spectral density of a discrete random process is given by the DTFT of its autocorrelation:

where

and where is the power spectral density of the function with discrete values . Being a sampled and discrete-time sequence, the spectral density is periodic in the frequency domain.

Application

[edit]

The theorem is useful for analyzing linear time-invariant systems, LTI systems, when the inputs and outputs are not square integrable, so their Fourier transforms do not exist. A corollary is that the Fourier transform of the autocorrelation function of the output of an LTI system is equal to the product of the Fourier transform of the autocorrelation function of the input of the system times the squared magnitude of the Fourier transform of the system impulse response.[6] This works even when the Fourier transforms of the input and output signals do not exist because these signals are not square integrable, so the system inputs and outputs cannot be directly related by the Fourier transform of the impulse response.

Since the Fourier transform of the autocorrelation function of a signal is the power spectrum of the signal, this corollary is equivalent to saying that the power spectrum of the output is equal to the power spectrum of the input times the power transfer function.

This corollary is used in the parametric method for power spectrum estimation.

Discrepancy of definition

[edit]

By the definitions involving infinite integrals in the articles on spectral density and autocorrelation, the Wiener–Khinchin theorem is a simple Fourier transform pair, trivially provable for any square integrable function, i.e. for functions whose Fourier transforms exist. More usefully, and historically, the theorem applies to wide-sense-stationary random processes, signals whose Fourier transforms do not exist, using the definition of autocorrelation function in terms of expected value rather than an infinite integral. This trivialization of the Wiener–Khinchin theorem is commonplace in modern technical literature, and obscures the contributions of Aleksandr Yakovlevich Khinchin, Norbert Wiener, and Andrey Kolmogorov.

Notes

[edit]
  1. ^ Dennis Ward Ricker (2003). Echo Signal Processing. Springer. ISBN 1-4020-7395-X.
  2. ^ Leon W. Couch II (2001). Digital and Analog Communications Systems (sixth ed. ed.). Prentice Hall, New Jersey. pp. 406–409. ISBN 0-13-522583-3. {{cite book}}: |edition= has extra text (help)
  3. ^ Krzysztof Iniewski (2007). Wireless Technologies: Circuits, Systems, and Devices. CRC Press. ISBN 0-8493-7996-2.
  4. ^ Joseph W. Goodman (1985). Statistical Optics. Wiley-Interscience. ISBN 0-471-01502-4.
  5. ^ Yaglom, A (1987) Einstein's 1914 Paper on the Theory of Irregularly Fluctuating Series of Observations IEEE ASSP Magazine, 4(4):7011
  6. ^ Shlomo Engelberg (2007). Random signals and noise: a mathematical introduction. CRC Press. p. 130. ISBN 978-0-8493-7554-5.

Category:Fourier analysis Category:Signal processing Category:Probability theorems