A Fast Fourier Transform or FFT is an algorithm that samples a signal over space (period of time) and divides it into its frequency components. The FFT is a fast implementation of the DFT (discrete Fourier transform), computational complexity is reduced by applying the FFT algorithm to a signal.

The FFT can simply be used to characterise the magnitude and phase of a signal, or it can be used in combination with other operations to perform computations such as convolution and correlation.

## 0 comments

Please sign in to leave a comment.