Cited by 5,086Digital Filter Design and ImplementationParallel Computing and Optimization TechniquesEmbedded Systems Design Techniques

The Design and Implementation of FFTW3

Frigo, M., Johnson, S.G.·2005·Proceedings of the IEEE

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.

Integrity signals

Registry

Crossref · 10.1109/jproc.2004.840301

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Frigo, M., & Johnson, S. G.
Affiliations
  • IBM Research - Austin (US)
  • Massachusetts Institute of Technology (US)
Venue
Proceedings of the IEEE
Published
2005-02
Volume
93
Issue
2
Pages
216-231
ISSN
0018-9219 (ISSN-L)
OpenAlex
W2102182691
Cited by
5,086
References
1
Citations by year
2026: 170 · 2025: 179 · 2024: 218 · 2023: 232 · 2022: 202 · 2021: 269 · 2020: 267 · 2019: 250 · 2018: 271 · 2017: 225 · 2016: 271 · 2015: 263 · 2014: 299 · 2013: 301 · 2012: 252
FWCI
275.60
Type
journal article
Language
en
Open access
closed
Locations
Proceedings of the IEEE (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
Keywords
discrete Fourier transform, SIMD instructions, automatic code generation, discrete cosine transform, discrete sine transform, software architecture

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review