This is machine translation

Translated by Microsoft
Mouseover text to see original. Click the button below to return to the English version of the page.

Note: This page has been translated by MathWorks. Click here to see
To view all translated materials including this page, select Country from the country navigator on the bottom of this page.


Discrete Fourier transform matrix


a = dftmtx(n)



a = dftmtx(n) returns an n-by-n complex discrete Fourier transform matrix.


collapse all

In practice, it is more efficient to compute the discrete Fourier transform with the FFT than with the DFT matrix. The FFT also uses less memory. The two procedures give the same result.

x = 1:256;

y1 = fft(x);

n = length(x);
y2 = x*dftmtx(n);

ans = 9.3125e-12

Input Arguments

collapse all

Discrete Fourier transform length, specified as an integer.

Data Types: single | double

Output Arguments

collapse all

Discrete Fourier transform matrix, returned as a matrix.

More About

collapse all

Discrete Fourier Transform Matrix

A discrete Fourier transform matrix is a complex matrix whose matrix product with a vector computes the discrete Fourier transform of the vector. dftmtx takes the FFT of the identity matrix to generate the transform matrix.

For a column vector x,

y = dftmtx(n)*x
is the same as y = fft(x,n). The inverse discrete Fourier transform matrix is
ainv = conj(dftmtx(n))/n

See Also


Introduced before R2006a