
- fft2 and ifft2  functions are used for 2-D FFT and IFFT respectively.
- fftn and ifftn functions are used for  N-D FFT and IFFT  respectively.


San Jose State University

Fourier transform is a mathematical tool which helps to break up  any kind of function or waveform existing in the universe into sinusoids. Discrete Fourier Transform ( DFT) is the main tool used in digital signal processing and Fast Fourier Transform(FFT) algorithms helps to  compute DFT efficiently..

- 1-D discrete Fourier transforms
- 2- and N-D discrete Fourier transforms

Fourier Transform using SciPy

https://docs.scipy.org/doc/scipy/tutorial/index.html

SciPy Documentation

DFT Analysis equation

$ X[k] = \sum_{n=0}^{N-1}x[n] e^{-2\pi j \frac{kn}{N}} , 0\leq k\leq N-1$

DFT Synthesis equation

$ x[n] =\frac{1}{N} \sum_{k=0}^{N-1}X[k] e^{2\pi j \frac{kn}{N}} , 0\leq n\leq N-1$


Learn Before

Related