Fast Fourier transform
The fast Fourier transform (FFT) is a family of algorithms for computing the discrete Fourier transform with substantially fewer operations than direct evaluation.
The fast Fourier transform (FFT) is a family of algorithms for computing the discrete Fourier transform with substantially fewer operations than direct evaluation.