Signal Processing Toolbox | ![]() ![]() |
Compute the two-dimensional fast Fourier transform.
Syntax
Y=
fft2(X) Y=
fft2(X,m,n)
Description
Y
performs a two-dimensional FFT, producing a result =
fft2(X)
Y
with the same size as X
. If X
is a vector, Y
has the same orientation as X
.
Y
truncates or zero pads =
fft2(X,m,n)
X
, if necessary, to create an m
-by-n
array before performing the FFT. The result Y
is also m
-by-n
.
The fft2
function is part of the standard MATLAB language.
Algorithm
fft(fft(x).').'
This computes the one-dimensional fft
of each column of x
, then of each row of the result. The time required to compute fft2(x)
depends on the number of prime factors in [m,n]
= size(x)
. fft2
is fastest when m
and n
are powers of 2.
See Also
|
One-dimensional fast Fourier transform. |
|
Rearrange the outputs of fft and fft2 . |
|
One-dimensional inverse fast Fourier transform. |
|
Two-dimensional inverse fast Fourier transform. |
![]() | fft | fftfilt | ![]() |