Girish Mahajan (Editor)

Periodogram

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In signal processing, a periodogram is an estimate of the spectral density of a signal.  The term was coined by Arthur Schuster in 1898. 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.

Contents

Definition

There are at least two different definitions in use today. One of them involves time-averaging, and one does not.  Time-averaging is also the purview of other articles (Bartlett's method and Welch's method). So this article is not about that. The definition of interest here is that the power spectral density of a continuous function, x ( t ) ,   is the Fourier transform of its auto-correlation function (see Cross-correlation theorem):

F { x ( t ) ∗ x ( − t ) } = X ( f ) ⋅ X ∗ ( f ) = | X ( f ) | 2 .

Computation

For sufficiently small values of parameter T, an arbitrarily-accurate approximation for X(f) can be observed in the region   − 1 2 T < f < 1 2 T   of the function:

X 1 / T ( f )   = def   ∑ k = − ∞ ∞ X ( f − k / T ) ,

which is precisely determined by the samples x(nT) that span the non-zero duration of x(t)  (see Discrete-time Fourier transform).

And for sufficiently large values of parameter N,   X 1 / T ( f ) can be evaluated at an arbitrarily close frequency by a summation of the form:

X 1 / T ( k N T ) = ∑ n = − ∞ ∞ T ⋅ x ( n T ) ⏟ x [ n ] ⋅ e − i 2 π k n N ,

where k is an integer. The periodicity of   e − i 2 π k n N   allows this to be written very simply in terms of a Discrete Fourier transform:

X 1 / T ( k N T ) = ∑ N x N [ n ] ⋅ e − i 2 π k n N , ⏟ D F T (sum over any  n -sequence of length  N ) ,

where xN is a periodic summation:   x N [ n ]   = def   ∑ m = − ∞ ∞ x [ n − m N ] .

When evaluated for all integers, k, between 0 and N-1, the array:

S ( k N T ) = | ∑ N x N [ n ] ⋅ e − i 2 π k n N | 2

is a periodogram.

Applications

The parameter N is known to Matlab and Octave users as NFFT.  When a periodogram is used to examine the detailed characteristics of an FIR filter or window function, N is chosen to be several multiples of the non-zero duration of the x[n] sequence, which is called zero-padding (see Sampling the DTFT). And when it is used to implement a filter bank, N is several sub-multiples of the non-zero duration of the x[n] sequence (see Sampling the DTFT).

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,  more commonly known as Welch's method,  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.

    • 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.

    References

    Periodogram Wikipedia
    (Text) CC BY-SA