FFTW
| Developer(s) | Matteo Frigo and Steven G. Johnson |
|---|---|
| Initial release | 24 March 1997 |
| Stable release | 3.3.4 / 16 March 2014 |
| Written in | C, OCaml |
| Type | Numerical software |
| License | GPL, commercial |
| Website |
www |
The Fastest Fourier Transform in the West (FFTW) is a software library for computing discrete Fourier transforms (DFTs) developed by Matteo Frigo and Steven G. Johnson at the Massachusetts Institute of Technology.[1][2][3]
FFTW is known as the fastest free software implementation of the Fast Fourier transform (FFT) algorithm (upheld by regular benchmarks[4]). It can compute transforms of real and complex-valued arrays of arbitrary size and dimension in O(n log n) time.
It does this by supporting a variety of algorithms and choosing the one (a particular decomposition of the transform into smaller transforms) it estimates or measures to be preferable in the particular circumstances. It works best on arrays of sizes with small prime factors, with powers of two being optimal and large primes being worst case (but still O(n log n)). To decompose transforms of composite sizes into smaller transforms, it chooses among several variants of the Cooley–Tukey FFT algorithm (corresponding to different factorizations and/or different memory-access patterns), while for prime sizes it uses either Rader's or Bluestein's FFT algorithm.[1] Once the transform has been broken up into subtransforms of sufficiently small sizes, FFTW uses hard-coded unrolled FFTs for these small sizes that were produced (at compile time, not at run time) by code generation; these routines use a variety of algorithms including Cooley–Tukey variants, Rader's algorithm, and prime-factor FFT algorithms.[1]
For a sufficiently large number of repeated transforms it is advantageous to measure the performance of some or all of the supported algorithms on the given array size and platform. These measurements, which the authors refer to as "wisdom", can be stored in a file or string for later use.
FFTW has a "guru interface" that intends "to expose as much as possible of the flexibility in the underlying FFTW architecture". This allows, among other things, multi-dimensional transforms and multiple transforms in a single call (e.g., where the data is interleaved in memory).
FFTW has limited support for out-of-order transforms (using the MPI version). The data reordering incurs an overhead, which for in-place transforms of arbitrary size and dimension is non-trivial to avoid. It is undocumented for which transforms this overhead is significant.
FFTW is licensed under the GNU General Public License. It is also licensed commercially by MIT[5] and is used in the commercial MATLAB[6] matrix package for calculating FFTs. FFTW is written in the C language, but Fortran and Ada interfaces exist, as well as interfaces for a few other languages. The Julia base library includes an interface to FFTW by default. [7] While the library itself is C, the code is actually generated from a program called 'genfft', which is written in OCaml.[8]
In 1999, FFTW won the J. H. Wilkinson Prize for Numerical Software.
See also
References
- 1 2 3 Frigo M, Johnson SG (February 2005). "The design and implementation of FFTW3" (PDF). Proceedings of the IEEE 93 (2): 216–231. doi:10.1109/JPROC.2004.840301.
- ↑ Frigo M, Johnson SG (1998). "FFTW: an adaptive software architecture for the FFT". Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing 3: 1381–1384. doi:10.1109/ICASSP.1998.681704.
- ↑ Johnson SG and Frigo M (September 2008). "ch.11: Implementing FFTs in practice". In C. S. Burrus. Fast Fourier Transforms. Houston TX: Connexions: Rice University.
- ↑ Homepage, second paragraph , and benchmarks page
- ↑
- ↑ Faster Finite Fourier Transforms: MATLAB 6 incorporates FFTW
- ↑ "Julia stdlib documentation"
- ↑ "FFTW FAQ"