The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Simple FFT and DCT algorithms with reduced number of operations
Open accessOverview
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
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
A Fast Computational Algorithm for the Discrete Cosine Transform
Chen, W.-H., Smith, C., & Fralick, S. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093941 · Cited by 1,148
Fast fourier transform and convolution algorithms
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90075-6 · Cited by 679
An algorithm for computing the mixed radix fast Fourier transform
Singleton, R. (1969) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1969.1162042 · Cited by 539
Fast Fourier Transform and Convolution Algorithms
Nussbaumer, H. J. (1982) · Springer Series in Information Sciences · doi:10.1007/978-3-642-81897-4 · Cited by 503
Self-citationDuhamel, P., & Hollmann, H. (1984) · Electronics Letters · doi:10.1049/el:19840012 · Cited by 417
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
A new principle for fast Fourier transformation
Rader, C. M., & Brenner, N. (1976) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1976.1162805 · Cited by 155
Cited by
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 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
Symmetric convolution and the discrete sine and cosine transforms
Martucci, S. A. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.295213 · Cited by 371
Metadata
- Authors
- Vetterli, M., Eurasip, M., & Nussbaumer, H. J.
- Venue
- Signal Processing
- Publisher
- Elsevier BV
- Published
- 1984-08
- Volume
- 6
- Issue
- 4
- Pages
- 267-278
- ISSN
- 0165-1684 (ISSN-L)
- OpenAlex
- W2084466783
- Cited by
- 334
- References
- 16
- FWCI
- 15.87
- Type
- journal article
- 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: Simple FFT and DCT algorithms with reduced number of operations. https://app.cochat.ai/papers/10.1016/0165-1684(84)90059-8
- The paper
- Vetterli, M., Eurasip, M., & Nussbaumer, H. J. (1984). Simple FFT and DCT algorithms with reduced number of operations. Signal Processing. https://doi.org/10.1016/0165-1684(84)90059-8
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.