Description: This article describes a new efficient implementation of the Cooley-Tukey fast Fourier transform (FFT) algorithm using C++ template metaprogramming. Thank to the recursive nature of the FFT, the source code is more readable and faster than the classical implementation. The efficiency is proved by performance benchmarks on different platforms.
- [fft-C] - Using C language designed FFT code in C
- [fftw-3.1.2-dll] - fftw, the fastest fourier transform in t
File list (Check if you may need any files):
FFT.doc
Download