Fourier transforms 

Continuous Fourier transform 
Fourier series 
Discretetime Fourier transform 
Discrete Fourier transform 
Discrete Fourier transform over a ring 
Fourier analysis 
Related transforms 
In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equallyspaced samples of a function into a samelength sequence of equallyspaced samples of the discretetime Fourier transform (DTFT), which is a complexvalued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies. It has the same samplevalues as the original input sequence. The DFT is therefore said to be a frequency domain representation of the original input sequence. If the original sequence spans all the nonzero values of a function, its DTFT is continuous (and periodic), and the DFT provides discrete samples of one cycle. If the original sequence is one cycle of a periodic function, the DFT provides all the nonzero values of one DTFT cycle.
The DFT is the most important discrete transform, used to perform Fourier analysis in many practical applications.^{[1]} In digital signal processing, the function is any quantity or signal that varies over time, such as the pressure of a sound wave, a radio signal, or daily temperature readings, sampled over a finite time interval (often defined by a window function^{[2]}). In image processing, the samples can be the values of pixels along a row or column of a raster image. The DFT is also used to efficiently solve partial differential equations, and to perform other operations such as convolutions or multiplying large integers.
Since it deals with a finite amount of data, it can be implemented in computers by numerical algorithms or even dedicated hardware. These implementations usually employ efficient fast Fourier transform (FFT) algorithms;^{[3]} so much so that the terms "FFT" and "DFT" are often used interchangeably. Prior to its current usage, the "FFT" initialism may have also been used for the ambiguous term "finite Fourier transform".
The discrete Fourier transform transforms a sequence of N complex numbers into another sequence of complex numbers, which is defined by

where the last expression follows from the first one by Euler's formula.
The transform is sometimes denoted by the symbol , as in or or .^{[A]}
Eq.1 can also be evaluated outside the domain , and that extended sequence is periodic. Accordingly, other sequences of indices are sometimes used, such as (if is even) and (if is odd), which amounts to swapping the left and right halves of the result of the transform.^{[4]}
Eq.1 can be interpreted or derived in various ways, for example:

which is also periodic. In the domain n ? [0, N  1], this is the inverse transform of Eq.1. In this interpretation, each is a complex number that encodes both amplitude and phase of a complex sinusoidal component of function The sinusoid's frequency is k cycles per N samples. Its amplitude and phase are:
The normalization factor multiplying the DFT and IDFT (here 1 and ) and the signs of the exponents are merely conventions, and differ in some treatments. The only requirements of these conventions are that the DFT and IDFT have oppositesign exponents and that the product of their normalization factors be . A normalization of for both the DFT and IDFT, for instance, makes the transforms unitary. A discrete impulse, at n = 0 and 0 otherwise; might transform to for all k (use normalization factors 1 for DFT and for IDFT). A DC signal, at k = 0 and 0 otherwise; might inversely transform to for all (use for DFT and 1 for IDFT) which is consistent with viewing DC as the mean average of the signal.
Let and
Here we demonstrate how to calculate the DFT of using Eq.1:
The discrete Fourier transform is an invertible, linear transformation
with denoting the set of complex numbers. Its inverse is known as Inverse Discrete Fourier Transform(IDFT). In other words, for any , an Ndimensional complex vector has a DFT and an IDFT which are in turn dimensional complex vectors.
The inverse transform is given by:

The DFT is a linear transform, i.e. if and , then for any complex numbers :
Reversing the time (i.e. replacing by )^{[B]} in corresponds to reversing the frequency (i.e. by ).^{[5]}^{:p.421} Mathematically, if represents the vector x then
If then .^{[5]}^{:p.423}
This table shows some mathematical operations on in the time domain and the corresponding effects on its DFT in the frequency domain.
Property  Time domain 
Frequency domain 

Real part in time  
Imaginary part in time  
Real part in frequency  
Imaginary part in frequency 
The vectors form an orthogonal basis over the set of Ndimensional complex vectors:
where is the Kronecker delta. (In the last step, the summation is trivial if , where it is 1+1+=N, and otherwise is a geometric series that can be explicitly summed to obtain zero.) This orthogonality condition can be used to derive the formula for the IDFT from the definition of the DFT, and is equivalent to the unitarity property below.
If and are the DFTs of and respectively then the Parseval's theorem states:
where the star denotes complex conjugation. Plancherel theorem is a special case of the Parseval's theorem and states:
These theorems are also equivalent to the unitary condition below.
The periodicity can be shown directly from the definition:
Similarly, it can be shown that the IDFT formula leads to a periodic extension.
Multiplying by a linear phase for some integer m corresponds to a circular shift of the output : is replaced by , where the subscript is interpreted modulo N (i.e., periodically). Similarly, a circular shift of the input corresponds to multiplying the output by a linear phase. Mathematically, if represents the vector x then
The convolution theorem for the discretetime Fourier transform (DTFT) indicates that a convolution of two sequences can be obtained as the inverse transform of the product of the individual transforms. An important simplification occurs when one of sequences is Nperiodic, denoted here by because is nonzero at only discrete frequencies (see DTFT § Periodic data), and therefore so is its product with the continuous function That leads to a considerable simplification of the inverse transform.
where is a periodic summation of the sequence:
Customarily, the DFT and inverse DFT summations are taken over the domain Defining those DFTs as and the result is:
In practice, the sequence is usually length N or less, and is a periodic extension of an Nlength sequence, which can also be expressed as a circular function:
Then the convolution can be written as:
which gives rise to the interpretation as a circular convolution of and ^{[6]}^{[7]} It is often used to efficiently compute their linear convolution. (see Circular convolution, Fast convolution algorithms, and Overlapsave)
Similarly, the crosscorrelation of and is given by:
It can also be shown that:
The trigonometric interpolation polynomial
where the coefficients X_{k} are given by the DFT of x_{n} above, satisfies the interpolation property for .
For even N, notice that the Nyquist component is handled specially.
This interpolation is not unique: aliasing implies that one could add N to any of the complexsinusoid frequencies (e.g. changing to ) without changing the interpolation property, but giving different values in between the points. The choice above, however, is typical because it has two useful properties. First, it consists of sinusoids whose frequencies have the smallest possible magnitudes: the interpolation is bandlimited. Second, if the are real numbers, then is real as well.
In contrast, the most obvious trigonometric interpolation polynomial is the one in which the frequencies range from 0 to (instead of roughly to as above), similar to the inverse DFT formula. This interpolation does not minimize the slope, and is not generally realvalued for real ; its use is a common mistake.
Another way of looking at the DFT is to note that in the above discussion, the DFT can be expressed as the DFT matrix, a Vandermonde matrix, introduced by Sylvester in 1867,
where is a primitive Nth root of unity.
The inverse transform is then given by the inverse of the above matrix,
With unitary normalization constants , the DFT becomes a unitary transformation, defined by a unitary matrix:
where is the determinant function. The determinant is the product of the eigenvalues, which are always or as described below. In a real vector space, a unitary transformation can be thought of as simply a rigid rotation of the coordinate system, and all of the properties of a rigid rotation can be found in the unitary DFT.
The orthogonality of the DFT is now expressed as an orthonormality condition (which arises in many areas of mathematics as described in root of unity):
If X is defined as the unitary DFT of the vector x, then
and the Parseval's theorem is expressed as
If we view the DFT as just a coordinate transformation which simply specifies the components of a vector in a new coordinate system, then the above is just the statement that the dot product of two vectors is preserved under a unitary DFT transformation. For the special case , this implies that the length of a vector is preserved as well  this is just Plancherel theorem,
A consequence of the circular convolution theorem is that the DFT matrix F diagonalizes any circulant matrix.
A useful property of the DFT is that the inverse DFT can be easily expressed in terms of the (forward) DFT, via several wellknown "tricks". (For example, in computations, it is often convenient to only implement a fast Fourier transform corresponding to one transform direction and then to get the other transform direction from the first.)
First, we can compute the inverse DFT by reversing all but one of the inputs (Duhamel et al., 1988):
(As usual, the subscripts are interpreted modulo N; thus, for , we have .)
Second, one can also conjugate the inputs and outputs:
Third, a variant of this conjugation trick, which is sometimes preferable because it requires no modification of the data values, involves swapping real and imaginary parts (which can be done on a computer simply by modifying pointers). Define as with its real and imaginary parts swappedthat is, if then is . Equivalently, equals . Then
That is, the inverse transform is the same as the forward transform with the real and imaginary parts swapped for both input and output, up to a normalization (Duhamel et al., 1988).
The conjugation trick can also be used to define a new transform, closely related to the DFT, that is involutorythat is, which is its own inverse. In particular, is clearly its own inverse: . A closely related involutory transformation (by a factor of ) is , since the factors in cancel the 2. For real inputs , the real part of is none other than the discrete Hartley transform, which is also involutory.
The eigenvalues of the DFT matrix are simple and wellknown, whereas the eigenvectors are complicated, not unique, and are the subject of ongoing research.
Consider the unitary form defined above for the DFT of length N, where
This matrix satisfies the matrix polynomial equation:
This can be seen from the inverse properties above: operating twice gives the original data in reverse order, so operating four times gives back the original data and is thus the identity matrix. This means that the eigenvalues satisfy the equation:
Therefore, the eigenvalues of are the fourth roots of unity: is +1, 1, +i, or i.
Since there are only four distinct eigenvalues for this matrix, they have some multiplicity. The multiplicity gives the number of linearly independent eigenvectors corresponding to each eigenvalue. (There are N independent eigenvectors; a unitary matrix is never defective.)
The problem of their multiplicity was solved by McClellan and Parks (1972), although it was later shown to have been equivalent to a problem solved by Gauss (Dickinson and Steiglitz, 1982). The multiplicity depends on the value of N modulo 4, and is given by the following table:
size N  ? = +1  ? = 1  ? = i  ? = +i 

4m  m + 1  m  m  m  1 
4m + 1  m + 1  m  m  m 
4m + 2  m + 1  m + 1  m  m 
4m + 3  m + 1  m + 1  m + 1  m 
Otherwise stated, the characteristic polynomial of is:
No simple analytical formula for general eigenvectors is known. Moreover, the eigenvectors are not unique because any linear combination of eigenvectors for the same eigenvalue is also an eigenvector for that eigenvalue. Various researchers have proposed different choices of eigenvectors, selected to satisfy useful properties like orthogonality and to have "simple" forms (e.g., McClellan and Parks, 1972; Dickinson and Steiglitz, 1982; Grünbaum, 1982; Atakishiyev and Wolf, 1997; Candan et al., 2000; Hanna et al., 2004; Gurevich and Hadani, 2008).
A straightforward approach is to discretize an eigenfunction of the continuous Fourier transform, of which the most famous is the Gaussian function. Since periodic summation of the function means discretizing its frequency spectrum and discretization means periodic summation of the spectrum, the discretized and periodically summed Gaussian function yields an eigenvector of the discrete transform:
The closed form expression for the series can be expressed by Jacobi theta functions as
Two other simple closedform analytical eigenvectors for special DFT period N were found (Kong, 2008):
For DFT period N = 2L + 1 = 4K + 1, where K is an integer, the following is an eigenvector of DFT:
For DFT period N = 2L = 4K, where K is an integer, the following is an eigenvector of DFT:
The choice of eigenvectors of the DFT matrix has become important in recent years in order to define a discrete analogue of the fractional Fourier transformthe DFT matrix can be taken to fractional powers by exponentiating the eigenvalues (e.g., Rubio and Santhanam, 2005). For the continuous Fourier transform, the natural orthogonal eigenfunctions are the Hermite functions, so various discrete analogues of these have been employed as the eigenvectors of the DFT, such as the Kravchuk polynomials (Atakishiyev and Wolf, 1997). The "best" choice of eigenvectors to define a fractional discrete Fourier transform remains an open question, however.
If the random variable X_{k} is constrained by
then
may be considered to represent a discrete probability mass function of n, with an associated probability mass function constructed from the transformed variable,
For the case of continuous functions and , the Heisenberg uncertainty principle states that
where and are the variances of and respectively, with the equality attained in the case of a suitably normalized Gaussian distribution. Although the variances may be analogously defined for the DFT, an analogous uncertainty principle is not useful, because the uncertainty will not be shiftinvariant. Still, a meaningful uncertainty principle has been introduced by Massar and Spindel.^{[8]}
However, the Hirschman entropic uncertainty will have a useful analog for the case of the DFT.^{[9]} The Hirschman uncertainty principle is expressed in terms of the Shannon entropy of the two probability functions.
In the discrete case, the Shannon entropies are defined as
and
and the entropic uncertainty principle becomes^{[9]}
The equality is obtained for equal to translations and modulations of a suitably normalized Kronecker comb of period where is any exact integer divisor of . The probability mass function will then be proportional to a suitably translated Kronecker comb of period .^{[9]}
There is also a wellknown deterministic uncertainty principle that uses signal sparsity (or the number of nonzero coefficients).^{[10]} Let and be the number of nonzero elements of the time and frequency sequences and , respectively. Then,
As an immediate consequence of the inequality of arithmetic and geometric means, one also has . Both uncertainty principles were shown to be tight for specificallychosen "picketfence" sequences (discrete impulse trains), and find practical use for signal recovery applications.^{[10]}
It follows that for even and are realvalued, and the remainder of the DFT is completely specified by just complex numbers.
It is possible to shift the transform sampling in time and/or frequency domain by some real shifts a and b, respectively. This is sometimes known as a generalized DFT (or GDFT), also called the shifted DFT or offset DFT, and has analogous properties to the ordinary DFT:
Most often, shifts of (half a sample) are used. While the ordinary DFT corresponds to a periodic signal in both time and frequency domains, produces a signal that is antiperiodic in frequency domain () and vice versa for . Thus, the specific case of is known as an oddtime oddfrequency discrete Fourier transform (or O^{2} DFT). Such shifted transforms are most often used for symmetric data, to represent different boundary symmetries, and for realsymmetric data they correspond to different forms of the discrete cosine and sine transforms.
Another interesting choice is , which is called the centered DFT (or CDFT). The centered DFT has the useful property that, when N is a multiple of four, all four of its eigenvalues (see above) have equal multiplicities (Rubio and Santhanam, 2005)^{[11]}
The term GDFT is also used for the nonlinear phase extensions of DFT. Hence, GDFT method provides a generalization for constant amplitude orthogonal block transforms including linear and nonlinear phase types. GDFT is a framework to improve time and frequency domain properties of the traditional DFT, e.g. auto/crosscorrelations, by the addition of the properly designed phase shaping function (nonlinear, in general) to the original linear phase functions (Akansu and AgirmanTosun, 2010).^{[12]}
The discrete Fourier transform can be viewed as a special case of the ztransform, evaluated on the unit circle in the complex plane; more general ztransforms correspond to complex shifts a and b above.
The ordinary DFT transforms a onedimensional sequence or array that is a function of exactly one discrete variable n. The multidimensional DFT of a multidimensional array that is a function of d discrete variables for in is defined by:
where as above and the d output indices run from . This is more compactly expressed in vector notation, where we define and as ddimensional vectors of indices from 0 to , which we define as :
where the division is defined as to be performed elementwise, and the sum denotes the set of nested summations above.
The inverse of the multidimensional DFT is, analogous to the onedimensional case, given by:
As the onedimensional DFT expresses the input as a superposition of sinusoids, the multidimensional DFT expresses the input as a superposition of plane waves, or multidimensional sinusoids. The direction of oscillation in space is . The amplitudes are . This decomposition is of great importance for everything from digital image processing (twodimensional) to solving partial differential equations. The solution is broken up into plane waves.
The multidimensional DFT can be computed by the composition of a sequence of onedimensional DFTs along each dimension. In the twodimensional case the independent DFTs of the rows (i.e., along ) are computed first to form a new array . Then the independent DFTs of y along the columns (along ) are computed to form the final result . Alternatively the columns can be computed first and then the rows. The order is immaterial because the nested summations above commute.
An algorithm to compute a onedimensional DFT is thus sufficient to efficiently compute a multidimensional DFT. This approach is known as the rowcolumn algorithm. There are also intrinsically multidimensional FFT algorithms.
For input data consisting of real numbers, the DFT outputs have a conjugate symmetry similar to the onedimensional case above:
where the star again denotes complex conjugation and the th subscript is again interpreted modulo (for ).
The DFT has seen wide usage across a large number of fields; we only sketch a few examples below (see also the references at the end). All applications of the DFT depend crucially on the availability of a fast algorithm to compute discrete Fourier transforms and their inverses, a fast Fourier transform.
When the DFT is used for signal spectral analysis, the sequence usually represents a finite set of uniformly spaced timesamples of some signal , where represents time. The conversion from continuous time to samples (discretetime) changes the underlying Fourier transform of into a discretetime Fourier transform (DTFT), which generally entails a type of distortion called aliasing. Choice of an appropriate samplerate (see Nyquist rate) is the key to minimizing that distortion. Similarly, the conversion from a very long (or infinite) sequence to a manageable size entails a type of distortion called leakage, which is manifested as a loss of detail (a.k.a. resolution) in the DTFT. Choice of an appropriate subsequence length is the primary key to minimizing that effect. When the available data (and time to process it) is more than the amount needed to attain the desired frequency resolution, a standard technique is to perform multiple DFTs, for example to create a spectrogram. If the desired result is a power spectrum and noise or randomness is present in the data, averaging the magnitude components of the multiple DFTs is a useful procedure to reduce the variance of the spectrum (also called a periodogram in this context); two examples of such techniques are the Welch method and the Bartlett method; the general subject of estimating the power spectrum of a noisy signal is called spectral estimation.
A final source of distortion (or perhaps illusion) is the DFT itself, because it is just a discrete sampling of the DTFT, which is a function of a continuous frequency domain. That can be mitigated by increasing the resolution of the DFT. That procedure is illustrated at § Sampling the DTFT.
See § FFT filter banks and § Sampling the DTFT.
The field of digital signal processing relies heavily on operations in the frequency domain (i.e. on the Fourier transform). For example, several lossy image and sound compression methods employ the discrete Fourier transform: the signal is cut into short segments, each is transformed, and then the Fourier coefficients of high frequencies, which are assumed to be unnoticeable, are discarded. The decompressor computes the inverse transform based on this reduced number of Fourier coefficients. (Compression applications often use a specialized form of the DFT, the discrete cosine transform or sometimes the modified discrete cosine transform.) Some relatively recent compression algorithms, however, use wavelet transforms, which give a more uniform compromise between time and frequency domain than obtained by chopping data into segments and transforming each segment. In the case of JPEG2000, this avoids the spurious image features that appear when images are highly compressed with the original JPEG.
Discrete Fourier transforms are often used to solve partial differential equations, where again the DFT is used as an approximation for the Fourier series (which is recovered in the limit of infinite N). The advantage of this approach is that it expands the signal in complex exponentials , which are eigenfunctions of differentiation: . Thus, in the Fourier representation, differentiation is simplewe just multiply by . (However, the choice of is not unique due to aliasing; for the method to be convergent, a choice similar to that in the trigonometric interpolation section above should be used.) A linear differential equation with constant coefficients is transformed into an easily solvable algebraic equation. One then uses the inverse DFT to transform the result back into the ordinary spatial representation. Such an approach is called a spectral method.
Suppose we wish to compute the polynomial product c(x) = a(x) · b(x). The ordinary product expression for the coefficients of c involves a linear (acyclic) convolution, where indices do not "wrap around." This can be rewritten as a cyclic convolution by taking the coefficient vectors for a(x) and b(x) with constant term first, then appending zeros so that the resultant coefficient vectors a and b have dimension d > deg(a(x)) + deg(b(x)). Then,
Where c is the vector of coefficients for c(x), and the convolution operator is defined so
But convolution becomes multiplication under the DFT:
Here the vector product is taken elementwise. Thus the coefficients of the product polynomial c(x) are just the terms 0, ..., deg(a(x)) + deg(b(x)) of the coefficient vector
With a fast Fourier transform, the resulting algorithm takes O (N log N) arithmetic operations. Due to its simplicity and speed, the CooleyTukey FFT algorithm, which is limited to composite sizes, is often chosen for the transform operation. In this case, d should be chosen as the smallest integer greater than the sum of the input polynomial degrees that is factorizable into small prime factors (e.g. 2, 3, and 5, depending upon the FFT implementation).
The fastest known algorithms for the multiplication of very large integers use the polynomial multiplication method outlined above. Integers can be treated as the value of a polynomial evaluated specifically at the number base, with the coefficients of the polynomial corresponding to the digits in that base (ex. ). After polynomial multiplication, a relatively lowcomplexity carrypropagation step completes the multiplication.
When data is convolved with a function with wide support, such as for downsampling by a large sampling ratio, because of the Convolution theorem and the FFT algorithm, it may be faster to transform it, multiply pointwise by the transform of the filter and then reverse transform it. Alternatively, a good filter is obtained by simply truncating the transformed data and retransforming the shortened data set.
Note  

Frequency shift theorem  
Time shift theorem  
Real DFT  
from the geometric progression formula  
from the binomial theorem  
is a rectangular window function of W points centered on n=0, where W is an odd integer, and is a sinclike function (specifically, is a Dirichlet kernel)  
Discretization and periodic summation of the scaled Gaussian functions for . Since either or is larger than one and thus warrants fast convergence of one of the two series, for large you may choose to compute the frequency spectrum and convert to the time domain using the discrete Fourier transform. 
The DFT can be interpreted as the complexvalued representation theory of the finite cyclic group. In other words, a sequence of complex numbers can be thought of as an element of dimensional complex space or equivalently a function from the finite cyclic group of order to the complex numbers, . So is a class function on the finite cyclic group, and thus can be expressed as a linear combination of the irreducible characters of this group, which are the roots of unity.
From this point of view, one may generalize the DFT to representation theory generally, or more narrowly to the representation theory of finite groups.
More narrowly still, one may generalize the DFT by either changing the target (taking values in a field other than the complex numbers), or the domain (a group other than a finite cyclic group), as detailed in the sequel.
Many of the properties of the DFT only depend on the fact that is a primitive root of unity, sometimes denoted or (so that ). Such properties include the completeness, orthogonality, Plancherel/Parseval, periodicity, shift, convolution, and unitarity properties above, as well as many FFT algorithms. For this reason, the discrete Fourier transform can be defined by using roots of unity in fields other than the complex numbers, and such generalizations are commonly called numbertheoretic transforms (NTTs) in the case of finite fields. For more information, see numbertheoretic transform and discrete Fourier transform (general).
The standard DFT acts on a sequence x_{0}, x_{1}, ..., x_{N−1} of complex numbers, which can be viewed as a function {0, 1, ..., N − 1} > C. The multidimensional DFT acts on multidimensional sequences, which can be viewed as functions
This suggests the generalization to Fourier transforms on arbitrary finite groups, which act on functions G > C where G is a finite group. In this framework, the standard DFT is seen as the Fourier transform on a cyclic group, while the multidimensional DFT is a Fourier transform on a direct sum of cyclic groups.
Further, Fourier transform can be on cosets of a group.
There are various alternatives to the DFT for various applications, prominent among which are wavelets. The analog of the DFT is the discrete wavelet transform (DWT). From the point of view of timefrequency analysis, a key limitation of the Fourier transform is that it does not include location information, only frequency information, and thus has difficulty in representing transients. As wavelets have location as well as frequency, they are better able to represent location, at the expense of greater difficulty representing frequency. For details, see comparison of the discrete wavelet transform with the discrete Fourier transform.
This is the most important numerical algorithm of our lifetime...