FFT - Fast Fourier Transform
Wednesday, 13 August 2003 05:55
The Fast Fourier Transform is an algorithm developed by
Tukey and Cooley in 1965 which reduces the number
of computations from something on the order of
N02 to N0 log
N0. There are basically two types of Tukey-Cooley
FFT algorithms in use: decimation-in-time and
decimation-in-frequency. The algorithm is simplified if
N0 is chosen to be a power of 2, but it is not a
requirement.
Last Updated on Wednesday, 13 August 2003 05:55