## A Fast Fourier Transform Compiler (1999)

### Cached

### Download Links

- [www.cs.cornell.edu]
- [supertech.csail.mit.edu]
- [supertech.csail.mit.edu]
- [ftp.fftw.org]
- DBLP

### Other Repositories/Bibliography

Citations: | 151 - 5 self |

### BibTeX

@MISC{Frigo99afast,

author = {Matteo Frigo},

title = {A Fast Fourier Transform Compiler},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

FFTW library for computing the discrete Fourier transform (DFT) has gained a wide acceptance in both academia and industry, because it provides excellent performance on a variety of machines (even competitive with or faster than equivalent libraries supplied by vendors). In FFTW, most of the performance-critical code was generated automatically by a special-purpose compiler, called genfft, that outputs C code. Written in Objective Caml, genfft can produce DFT programs for any input length, and it can specialize the DFT program for the common case where the input data are real instead of complex. Unexpectedly, genfft “discovered” algorithms that were previously unknown, and it was able to reduce the arithmetic complexity of some other existing algorithms. This paper describes the internals of this special-purpose compiler in some detail, and it argues that a specialized compiler is a valuable tool.