The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data
Abstract
A new algorithm is presented for the fast computation of the discrete Fourier transform. This algorithm belongs to that class of recently proposed 2n-FFT's which present the same arithmetic complexity (the lowest among any previously published one). Moreover, this algorithm has the advantage of being performed "in-place," by repetitive use of a "butterfly"-type structure, without any data reordering inside the algorithm. Furthermore, it can easily be applied to real and real-symmetric data with reduced arithmetic complexity by removing all redundancy in the 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
On computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Fast algorithms for the discrete W transform and for the discrete Fourier transform
Wang, Z. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164399 · Cited by 597
Duhamel, P., & Hollmann, H. (1984) · Electronics Letters · doi:10.1049/el:19840012 · Cited by 417
Self-citationSimple FFT and DCT algorithms with reduced number of operations
Vetterli, M., Eurasip, M., & Nussbaumer, H. J. (1984) · Signal Processing · doi:10.1016/0165-1684(84)90059-8 · Cited by 334
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
On Computing the Discrete Fourier Transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.2307/2006266 · Cited by 279
An in-place, in-order prime factor FFT algorithm
Burrus, C., & Eschenbacher, P. (1981) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1981.1163645 · Cited by 175
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
Numerical Analysis: A fast fourier transform algorithm for real-valued series
Bergland, G. D. (1968) · Communications of the ACM · doi:10.1145/364096.364118 · Cited by 136
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
Superfast Solution of Real Positive Definite Toeplitz Systems
Ammar, G. S., & Gragg, W. B. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609005 · Cited by 258
Metadata
- Authors
- Duhamel, P.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1986-04
- Volume
- 34
- Issue
- 2
- Pages
- 285-295
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2099490452
- Cited by
- 268
- References
- 15
- FWCI
- 13.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: Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data. https://app.cochat.ai/papers/10.1109/tassp.1986.1164811
- The paper
- Duhamel, P. (1986). Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1986.1164811
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.