The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Fastest Fourier Transform in the West
Open accessAbstract
This paper describes FFTW, a portable C package for computing the one-and multidimensional complex discrete Fourier transform (DFT).FFTW is typically faster than all other publicly available DFT software, including the well-known FFTPACK and the code from Numerical Recipes.More interestingly, FFTW is competitive with or better than proprietary, highly-tuned codes such as Sun's Performance Library and IBM's ESSL library.FFTW implements the Cooley-Tukey fast Fourier transform, and is freely available on the Web at http://theory.lcs.mit.edu/˜fftw.Three main ideas are the keys to FFTW's performance.First, the computation of the transform is performed by an executor consisting of highly-optimized, composable blocks of C code called codelets.Second, at runtime, a planner finds an efficient way (called a 'plan') to compose the codelets.Through the planner, FFTW adapts itself to the architecture of the machine it is running on.Third, the codelets are automatically generated by a codelet generator written in the Caml Light dialect of ML.The codelet generator produces long, optimized, unreadable code, which is nevertheless easy to modify via simple changes to the generator.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Cited by
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
FITTING POPULATION MODELS INCORPORATING PROCESS NOISE AND OBSERVATION ERROR
de Valpine, P., & Hastings, A. (2002) · Ecological Monographs · doi:10.1890/0012-9615(2002)072[0057:fpmipn]2.0.co;2 · Cited by 499
A fast Fourier transform compiler
Frigo, M. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301661 · Cited by 438
Self-citationSimilarity search over time-series data using wavelets
Popivanov, I., & Miller, R. J. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994711 · Cited by 280
Minimizing development and maintenance costs in supporting persistently optimized BLAS
Whaley, R. C., & Petitet, A. (2005) · Software: Practice and Experience · doi:10.1002/spe.626 · Cited by 254
Metadata
- Authors
- Frigo, M., & Johnson, S. G.
- Publisher
- Defense Technical Information Center
- Published
- 1997-09-11
- OpenAlex
- W1631114303
- Cited by
- 244
- References
- 1
- Type
- report
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Fastest Fourier Transform in the West. https://app.cochat.ai/papers/10.21236/ada479065
- The paper
- Frigo, M., & Johnson, S. G. (1997). The Fastest Fourier Transform in the West. https://doi.org/10.21236/ada479065
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.