The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms
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
Self-citation
Cited by
The Fourier-series method for inverting transforms of probability distributions
Abate, J., & Whitt, W. (1992) · Queueing Systems · doi:10.1007/bf01158520 · Cited by 697
Numerical inversion of the laplace transform: a survey and comparison of methods
Davies, B., & Martin, B. (1979) · Journal of Computational Physics · doi:10.1016/0021-9991(79)90025-1 · Cited by 668
Real-valued fast Fourier transform algorithms
Sorensen, H., Jones, D., Heideman, M., & Burrus, C. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165220 · Cited by 500
Metadata
- Authors
- Cooley, J. W., Lewis, P. A. W., & Welch, P. D.
- Venue
- Journal of Sound and Vibration
- Publisher
- Elsevier BV
- Published
- 1970-07
- Volume
- 12
- Issue
- 3
- Pages
- 315-337
- ISSN
- 0022-460X (ISSN-L)
- OpenAlex
- W2001271893
- Cited by
- 252
- References
- 1
- FWCI
- 9.68
- Type
- journal article
- Language
- en
- Open access
- closed
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 fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms. https://app.cochat.ai/papers/10.1016/0022-460x(70)90075-1
- The paper
- Cooley, J. W., Lewis, P. A. W., & Welch, P. D. (1970). The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms. Journal of Sound and Vibration. https://doi.org/10.1016/0022-460x(70)90075-1
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.
