Description: The use of classical Cooley-Tukey algorithm for radix-2 complex DFT sequence. FFT Cooley-Tukey presented enables multiplication of the amount of N-point DFT has N ^ 2 times reduced to N/2* log2 (N) times.
To Search:
File list (Check if you may need any files):
MCMPFFT.C
Download