Template:Short description In signal processing, a periodogram is an estimate of the spectral density of a signal. The term was coined by Arthur Schuster in 1898.<ref name="Schuster"/> Today, the periodogram is a component of more sophisticated methods (see spectral estimation). It is the most common tool for examining the amplitude vs frequency characteristics of FIR filters and window functions. FFT spectrum analyzers are also implemented as a time-sequence of periodograms.

DefinitionEdit

There are at least two different definitions in use today.<ref name="Comparison"/> One of them involves time-averaging,<ref name="Wolfram"/> and one does not.<ref name="Matlab"/> Time-averaging is also the purview of other articles (Bartlett's method and Welch's method). This article is not about time-averaging. The definition of interest here is that the power spectral density of a continuous function, <math>x(t),</math>  is the Fourier transform of its auto-correlation function (see Cross-correlation theorem, Spectral density, and Wiener–Khinchin theorem): <math display="block">\mathcal{F}\{x(t)\circledast x^*(-t)\} = X(f)\cdot X^*(f) = \left| X(f) \right|^2.</math>

ComputationEdit

File:Periodogram.svg
A power spectrum (magnitude-squared) of two sinusoidal basis functions, calculated by the periodogram method.
File:Periodogram windows.svg
Two power spectra (magnitude-squared) (rectangular and Hamming window functions plus background noise), calculated by the periodogram method.

For sufficiently small values of parameter Template:Mvar an arbitrarily-accurate approximation for Template:Math can be observed in the region  <math>-\tfrac{1}{2T} < f < \tfrac{1}{2T}</math>  of the function:

<math display="block">X_{1/T}(f)\ \triangleq \sum_{k=-\infty}^{\infty} X\left(f - k/T\right),</math>

which is precisely determined by the samples Template:Math that span the non-zero duration of Template:Math  (see Discrete-time Fourier transform).

And for sufficiently large values of parameter Template:Mvar,  <math>X_{1/T}(f)</math> can be evaluated at an arbitrarily close frequency by a summation of the form:

<math display="block">X_{1/T}\left(\tfrac{k}{NT}\right) = \sum_{n=-\infty}^\infty \underbrace{T\cdot x(nT)}_{x[n]}\cdot e^{-i 2\pi \frac{kn}{N}},</math>

where Template:Mvar is an integer. The periodicity of  <math>e^{-i 2\pi \frac{kn}{N}}</math>  allows this to be written very simply in terms of a Discrete Fourier transform:

<math display="block">X_{1/T}\left(\tfrac{k}{NT}\right) = \underbrace{\sum_{n} x_{_N}[n]\cdot e^{-i 2\pi \frac{kn}{N}},}_\text{DFT} \quad \scriptstyle{\text{(sum over any }n\text{-sequence of length }N)},</math>

where <math>x_{_N}</math> is a periodic summation:  <math>x_{_N}[n]\ \triangleq \sum_{m=-\infty}^{\infty} x[n - mN].</math>

When evaluated for all integers, Template:Mvar, between 0 and Template:Mvar-1, the array: <math display="block">S\left(\tfrac{k}{NT}\right) = \left| \sum_{n} x_{_N}[n]\cdot e^{-i 2\pi \frac{kn}{N}} \right|^2</math> is a periodogram.<ref name="Matlab"/><ref name=Oppenheim/><ref name=Rabiner/>

ApplicationsEdit

When a periodogram is used to examine the detailed characteristics of an FIR filter or window function, the parameter Template:Mvar is chosen to be several multiples of the non-zero duration of the Template:Math sequence, which is called zero-padding (see Template:Slink).Template:Efn-ua  When it is used to implement a filter bank, Template:Mvar is several sub-multiples of the non-zero duration of the Template:Math sequence (see Template:Slink).

One of the periodogram's deficiencies is that the variance at a given frequency does not decrease as the number of samples used in the computation increases. It does not provide the averaging needed to analyze noiselike signals or even sinusoids at low signal-to-noise ratios. Window functions and filter impulse responses are noiseless, but many other signals require more sophisticated methods of spectral estimation. Two of the alternatives use periodograms as part of the process:

  • The method of averaged periodograms,<ref name="Engelberg"/>  more commonly known as Welch's method,<ref name="Welch"/><ref name="Welch2"/>  divides a long x[n] sequence into multiple shorter, and possibly overlapping, subsequences. It computes a windowed periodogram of each one, and computes an array average, i.e. an array where each element is an average of the corresponding elements of all the periodograms. For stationary processes, this reduces the noise variance of each element by approximately a factor equal to the reciprocal of the number of periodograms.
  • Smoothing is an averaging technique in frequency, instead of time. The smoothed periodogram is sometimes referred to as a spectral plot.<ref name="smoothing"/><ref name="dataplot"/>

Periodogram-based techniques introduce small biases that are unacceptable in some applications. Other techniques that do not rely on periodograms are presented in the spectral density estimation article.

See alsoEdit

NotesEdit

Template:Notelist-ua

ReferencesEdit

Template:Reflist

Further readingEdit

Template:Refbegin

Template:Refend