2D FFT
Compute 2D fast Fourier transform (FFT)
Libraries:
Computer Vision Toolbox /
Transforms
Description
The 2D FFT block computes the discrete Fourier transform (DFT) of a twodimensional input matrix using the fast Fourier transform (FFT) algorithm. The equation for the twodimensional DFT F(m, n) of an MbyN input matrix, f(x, y), is:
$$F(m,n)={\displaystyle \sum _{x=0}^{M1}{\displaystyle \sum _{y=0}^{N1}f(x,y){e}^{j\frac{2\pi mx}{M}}}}{e}^{j\frac{2\pi ny}{N}}$$
where $$0\le m\le M1$$ and $$0\le n\le N1$$.
The block supports FFT implementation based on the FFTW library and an implementation based on a collection of Radix2 algorithms. You can either manually select one of these implementations or let the block select one automatically.
Examples
Ports
Input
Output
Parameters
Block Characteristics
Data Types 

Multidimensional Signals 

VariableSize Signals 

More About
Algorithms
References
[1] “FFTW Home Page.” Accessed February 23, 2022. https://www.fftw.org/.
[2] Frigo, M., and S.G. Johnson. “FFTW: An Adaptive Software Architecture for the FFT.” In Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP ’98 (Cat. No.98CH36181), 3:1381–84. Seattle, WA, USA: IEEE, 1998. https://doi.org/10.1109/ICASSP.1998.681704.
Extended Capabilities
Version History
Introduced before R2006a