Fast Fourier transform
no vote
A fast Fourier transform is an algorithm to compute the discrete Fourier transform and its inverse. Fourier analysis converts time to frequency and vice versa; an FFT rapidly computes such transformations by factorizingthe DFT matrix into a product of sparse factors.