The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
On Computing the Discrete Fourier Transform
Abstract
A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete 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
Discrete Fourier transforms when the number of data samples is prime
Rader, C. M. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6477 · Cited by 535
Some bilinear forms whose multiplicative complexity depends on the field of constants
Winograd, S. (1976) · Mathematical Systems Theory · doi:10.1007/bf01683270 · Cited by 165
Self-citationAlgebras Having Linear Multiplicative Complexities
Fiduccia, C. M., & Zalcstein, Y. (1977) · Journal of the ACM · doi:10.1145/322003.322014 · Cited by 69
Cited by
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
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
Fast algorithms for the discrete cosine transform
Feig, E., & Winograd, S. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157218 · Cited by 408
Self-citationA modified split-radix fft with fewer arithmetic operations
Johnson, S. G., & Frigo, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.882087 · Cited by 380
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
Wold, & Despain (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676458 · Cited by 299
Metadata
- Authors
- Winograd, S.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1978-01
- Volume
- 32
- Issue
- 141
- Pages
- 175
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W4254389654
- Cited by
- 279
- References
- 4
- FWCI
- 11.03
- 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: On Computing the Discrete Fourier Transform. https://app.cochat.ai/papers/10.2307/2006266
- The paper
- Winograd, S. (1978). On Computing the Discrete Fourier Transform. Mathematics of Computation. https://doi.org/10.2307/2006266
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.