MATLAB Function Reference    

Multidimensional discrete Fourier transform



Y = fftn(X) returns the discrete Fourier transform (DFT) of X, computed with a multidimensional fast Fourier transform (FFT) algorithm. The result Y is the same size as X.

Y = fftn(X,siz) pads X with zeros, or truncates X, to create a multidimensional array of size siz before performing the transform. The size of the result Y is siz.


fftn(X) is equivalent to

This computes in-place the one-dimensional fast Fourier transform along each dimension of X. The execution time for fft depends on the length of the transform. It is fastest for powers of two. It is almost as fast for lengths that have only small prime factors. It is typically several times slower for lengths that are prime or which have large prime factors.

See Also

fft, fft2, fftn, ifftn

  fft2 fftshift