Discrete-time Fourier transform


In mathematics, the discrete-time Fourier transform is a form of Fourier analysis that is applicable to a sequence of values.
The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function. Under certain theoretical conditions, described by the sampling theorem, the original continuous function can be recovered perfectly from the DTFT and thus from the original discrete samples. The DTFT itself is a continuous function of frequency, but discrete samples of it can be readily calculated via the discrete Fourier transform , which is by far the most common method of modern Fourier analysis.
Both transforms are invertible. The inverse DTFT is the original sampled data sequence. The inverse DFT is a periodic summation of the original sequence. The fast Fourier transform is an algorithm for computing one cycle of the DFT, and its inverse produces one cycle of the inverse DFT.

Definition

The discrete-time Fourier transform of a discrete set of real or complex numbers, for all integers, is a Fourier series, which produces a periodic function of a frequency variable. When the frequency variable, ω, has normalized units of radians/sample, the periodicity is, and the Fourier series is:
The utility of this frequency domain function is rooted in the Poisson summation formula. Let be the Fourier transform of any function,, whose samples at some interval are equal to the sequence, i.e.. Then the periodic function represented by the Fourier series is a periodic summation of in terms of frequency in hertz :
The integer has units of cycles/sample, and is the sample-rate, . So comprises exact copies of that are shifted by multiples of hertz and combined by addition. For sufficiently large the term can be observed in the region with little or no distortion from the other terms. In Fig.1, the extremities of the distribution in the upper left corner are masked by aliasing in the periodic summation.
We also note that is the Fourier transform of. Therefore, an alternative definition of DTFT is:
The modulated Dirac comb function is a mathematical abstraction sometimes referred to as impulse sampling.

Inverse transform

An operation that recovers the discrete data sequence from the DTFT function is called an inverse DTFT. For instance, the inverse continuous Fourier transform of both sides of produces the sequence in the form of a modulated Dirac comb function:
However, noting that is periodic, all the necessary information is contained within any interval of length. In both and, the summations over n are a Fourier series, with coefficients. The standard formulas for the Fourier coefficients are also the inverse transforms:

Periodic data

When the input data sequence is -periodic, can be computationally reduced to a discrete Fourier transform, because:
The DFT coefficients are given by:
Substituting this expression into the inverse transform formula confirms:
as expected.

Sampling the DTFT

When the DTFT is continuous, a common practice is to compute an arbitrary number of samples of one cycle of the periodic function :
where is a periodic summation:
The sequence is the inverse DFT. Thus, our sampling of the DTFT causes the inverse transform to become periodic. The array of values is known as a periodogram, and the parameter is called NFFT in the Matlab function of the same name.
In order to evaluate one cycle of numerically, we require a finite-length sequence. For instance, a long sequence might be truncated by a window function of length resulting in three cases worthy of special mention. For notational simplicity, consider the values below to represent the values modified by the window function.
Case: Frequency decimation. , for some integer
A cycle of reduces to a summation of segments of length. The DFT then goes by various names, such as:
Recall that decimation of sampled data in one domain produces overlap in the other, and vice versa. Compared to an -length DFT, the summation/overlap causes decimation in frequency, leaving only DTFT samples least affected by spectral leakage. That is usually a priority when implementing an FFT filter-bank. With a conventional window function of length, scalloping loss would be unacceptable. So multi-block windows are created using FIR filter design tools. Their frequency profile is flat at the highest point and falls off quickly at the midpoint between the remaining DTFT samples. The larger the value of parameter, the better the potential performance.
Case:, where is even-valued
This case arises in the context of Window function design, out of a desire for real-valued DFT coefficients. When a symmetric sequence is associated with the indices known as a finite Fourier transform data window, its DTFT, a continuous function of frequency is real-valued. When the sequence is shifted into a DFT data window, the DTFT is multiplied by a complex-valued phase function: . But when sampled at frequencies for integer values of the samples are all real-valued. To achieve that goal, we can perform a -length DFT on a periodic summation with 1-sample of overlap. Specifically, the last sample of a data sequence is deleted and its value added to the first sample. Then a window function, shortened by 1 sample, is applied, and the DFT is performed. The shortened, even-length window function is sometimes called DFT-even.
Case: Frequency interpolation.
In this case, the DFT simplifies to a more familiar form:
In order to take advantage of a fast Fourier transform algorithm for computing the DFT, the summation is usually performed over all terms, even though of them are zeros. Therefore, the case is often referred to as zero-padding.
Spectral leakage, which increases as decreases, is detrimental to certain important performance metrics, such as resolution of multiple frequency components and the amount of noise measured by each DTFT sample. But those things don't always matter, for instance when the sequence is a noiseless sinusoid, shaped by a window function. Then it is a common practice to use zero-padding to graphically display and compare the detailed leakage patterns of window functions. To illustrate that for a rectangular window, consider the sequence:
Figures 2 and 3 are plots of the magnitude of two different sized DFTs, as indicated in their labels. In both cases, the dominant component is at the signal frequency:. Also visible in Fig 2 is the spectral leakage pattern of the rectangular window. The illusion in Fig 3 is a result of sampling the DTFT at just its zero-crossings. Rather than the DTFT of a finite-length sequence, it gives the impression of an infinitely long sinusoidal sequence. Contributing factors to the illusion are the use of a rectangular window, and the choice of a frequency with exactly 8 cycles per 64 samples. A Hann window would produce a similar result, except the peak would be widened to 3 samples.

Convolution

The convolution theorem for sequences is:
An important special case is the circular convolution of sequences and defined by where is a periodic summation. The discrete-frequency nature of means that the product with the continuous function is also discrete, which results in considerable simplification of the inverse transform:
For and sequences whose non-zero duration is less than or equal to, a final simplification is:
The significance of this result is explained at Circular convolution and Fast convolution algorithms.

Symmetry properties

When the real and imaginary parts of a complex function are decomposed into their even and odd parts, there are four components, denoted below by the subscripts RE, RO, IE, and IO. And there is a one-to-one mapping between the four components of a complex time function and the four components of its complex frequency transform:
From this, various relationships are apparent, for example:
is a Fourier series that can also be expressed in terms of the bilateral Z-transform. I.e.:
where the notation distinguishes the Z-transform from the Fourier transform. Therefore, we can also express a portion of the Z-transform in terms of the Fourier transform:
Note that when parameter changes, the terms of remain a constant separation apart, and their width scales up or down. The terms of remain a constant width and their separation scales up or down.

Table of discrete-time Fourier transforms

Some common transform pairs are shown in the table below. The following notation applies:
Time domain
x		Frequency domain
X2π		RemarksReference
integer

odd M
even M
integer

The term must be interpreted as a distribution in the sense of a Cauchy principal value around its poles at.
-π < a < π
real number

real number with
real number with
integers and
real numbers with
real number,
it works as a differentiator filter-
real numbers with
Hilbert transform
real numbers
complex

Properties

This table shows some mathematical operations in the time domain and the corresponding effects in the frequency domain.
PropertyTime domain
Frequency domain
RemarksReference
Linearitycomplex numbers
Time reversal / Frequency reversal
Time conjugation
Time reversal & conjugation
Real part in time
Imaginary part in time
Real part in frequency
Imaginary part in frequency
Shift in time / Modulation in frequencyinteger
Shift in frequency / Modulation in timereal number
Decimation integer
Time Expansioninteger
Derivative in frequency
Integration in frequency
Differencing in time
Summation in time
Convolution in time / Multiplication in frequency
Multiplication in time / Convolution in frequencyPeriodic convolution
Cross correlation
Parseval's theorem

Page citations