The design and implementation of FFTW3 (2005)
| Venue: | Proceedings of the IEEE |
| Citations: | 255 - 4 self |
BibTeX
@INPROCEEDINGS{Frigo05thedesign,
author = {Matteo Frigo and Steven and G. Johnson},
title = {The design and implementation of FFTW3},
booktitle = {Proceedings of the IEEE},
year = {2005},
pages = {216--231}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
FFTW is an implementation of the discrete Fourier transform (DFT) that adapts to the hardware in order to maximize performance. This paper shows that such an approach can yield an implementation that is competitive with hand-optimized libraries, and describes the software structure that makes our current FFTW3 version flexible and adaptive. We further discuss a new algorithm for real-data DFTs of prime size, a new way of implementing DFTs by means of machine-specific single-instruction, multiple-data (SIMD) instructions, and how a special-purpose compiler can derive optimized implementations of the discrete cosine and sine transforms automatically from a DFT algorithm. Keywords—Adaptive software, cosine transform, fast Fourier transform (FFT), Fourier transform, Hartley transform, I/O tensor.
