The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An introduction to programming the Winograd Fourier transform algorithm (WFTA)
Abstract
Recently, Dr. Shmuel Winograd discovered a new approach to the computation of the discrete Fourier transform (DFT). Relative to fast Fourier transform (FFT), the Winograd Fourier transform algorithm (WFTA) significantly reduces the number of multiplication operations; it does not increase the number of addition operations in many cases. This paper introduces the new algorithm and discusses the operations comparison problem. A guide for programming is included, as are some preliminary running times.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Fast fourier transforms: A tutorial review and a state of the art
Duhamel, P., & Vetterli, M. (1990) · Signal Processing · doi:10.1016/0165-1684(90)90158-u · Cited by 1,143
Digital signal processing for sonar
Knight, W. C., Pridham, R. G., & Kay, S. M. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.12186 · Cited by 410
On the Computation of the Discrete Cosine Transform
Narasimha, M., & Peterson, A. (1978) · IEEE Transactions on Communications · doi:10.1109/tcom.1978.1094144 · Cited by 319
A prime factor FFT algorithm using high-speed convolution
Kolba, D., & Parks, T. (1977) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1977.1162973 · Cited by 308
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
- Silverman, H.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1977-04
- Volume
- 25
- Issue
- 2
- Pages
- 152-165
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2065387773
- Cited by
- 165
- References
- 1
- FWCI
- 17.51
- 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: An introduction to programming the Winograd Fourier transform algorithm (WFTA). https://app.cochat.ai/papers/10.1109/tassp.1977.1162924
- The paper
- Silverman, H. (1977). An introduction to programming the Winograd Fourier transform algorithm (WFTA). IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1977.1162924
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.