The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The finite Fourier transform
Abstract
The finite Fourier transform of a finite sequence is defined and its elementary properties are developed. The convolution and term-by-term product operations are defined and their equivalent operations in transform space are given. A discussion of the transforms of stretched and sampled functions leads to a sampling theorem for finite sequences. Finally, these results are used to give a simple derivation of the fast Fourier transform algorithm.
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
On the use of windows for harmonic analysis with the discrete Fourier transform
Harris, F. J. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.10837 · Cited by 7,326
Single tone parameter estimation from discrete-time observations
Rife, D., & Boorstyn, R. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055282 · Cited by 1,930
The Shannon sampling theorem—Its various extensions and applications: A tutorial review
Jerri, A. J. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10771 · Cited by 1,749
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
A spectral method for confidence interval generation and run length control in simulations
Heidelberger, P., & Welch, P. D. (1981) · Communications of the ACM · doi:10.1145/358598.358630 · Cited by 436
Self-citation
Metadata
- Authors
- Cooley, J., Lewis, P., & Welch, P.
- Venue
- IEEE Transactions on Audio and Electroacoustics
- Published
- 1969-06
- Volume
- 17
- Issue
- 2
- Pages
- 77-85
- ISSN
- 0018-9278 (ISSN-L)
- OpenAlex
- W2142716857
- Cited by
- 198
- References
- 1
- FWCI
- 7.99
- 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 finite Fourier transform. https://app.cochat.ai/papers/10.1109/tau.1969.1162036
- The paper
- Cooley, J., Lewis, P., & Welch, P. (1969). The finite Fourier transform. IEEE Transactions on Audio and Electroacoustics. https://doi.org/10.1109/tau.1969.1162036
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.