Skip to content

The Design and Implementation of FFTW3

Matteo Frigo, Steven G. Johnson

Proceedings of the IEEE · 2005 · 5,261 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Frigo, M., & Johnson, S. G. (2005). The design and implementation of FFTW3. Proceedings of the IEEE, 93(2), 216–231. https://doi.org/10.1109/jproc.2004.840301

In text: (Frigo & Johnson, 2005)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Array programming with NumPy2020
  2. MapReduce2008
  3. LINCS: A linear constraint solver for molecular simulations1997
  4. GROMACS 4: Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation2008
  5. LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales2021

Metadata from OpenAlex (CC0). Citations are generated from the published record.