It was developed by Tukey and Cooley in 1965 as a special case of a more general procedure, and it reduces computation time from order N squared to order N log N. If N is a power of two, it can be computed using the Danielson- Lanczos lemma, and it comes in two types, decimation-in-time and decimation- in-frequency.  
It was developed by Tukey and Cooley in 1965 as a special case of a more general procedure, and it reduces computation time from order N squared to order N log N. If N is a power of two, it can be computed using the Danielson- Lanczos lemma, and it comes in two types, decimation-in-time and decimation- in-frequency.  Widely used in digital signal processing applications, FTP, identify this special case of a discrete transform named after a French mathematician.
It was developed by Tukey and Cooley in 1965 as a special case of a more general procedure, and it reduces computation time from order N squared to order N log N. If N is a power of two, it can be computed using the Danielson- Lanczos lemma, and it comes in two types, decimation-in-time and decimation- in-frequency.  
FFT (or Fast Fourier Transform)