1 FFTW is a free collection of fast C routines for computing the
2 Discrete Fourier Transform in one or more dimensions. It includes
3 complex, real, symmetric, and parallel transforms, and can handle
4 arbitrary array sizes efficiently. FFTW is typically faster than
5 other publically-available FFT implementations, and is even
6 competitive with vendor-tuned libraries. (See our web page for
7 extensive benchmarks.) To achieve this performance, FFTW uses novel
8 code-generation and runtime self-optimization techniques (along with