The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
High-speed convolution and correlation
Open accessAbstract
Cooley and Tukey have disclosed a procedure for synthesizing and analyzing Fourier series for discrete periodic complex functions. For functions of period N, where N is a power of 2, computation times are proportional to N log2 N as expressed in Eq. (0).
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
The Measurement of Power Spectra
Blackman, R. B., Tukey, J. W., & Teichmann, T. (1960) · Physics Today · doi:10.1063/1.3056826 · Cited by 1,843
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
“Perhaps the oldest alternative is the Stockham auto-sort FFT [17], [21], which transforms back and forth be-tween two arrays with each butterfly, transposing one digit each time, and was popular to improve contiguity of access for vector computers [22].”
Short term spectral analysis, synthesis, and modification by discrete Fourier transform
Allen, J. (1977) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1977.1162950 · Cited by 1,051
A guided tour of the fast Fourier transform
Bergland, G. D. (1969) · IEEE Spectrum · doi:10.1109/mspec.1969.5213896 · Cited by 673
Time-frequency representation of digital signals and systems based on short-time Fourier analysis
Portnoff, M. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163359 · Cited by 656
The chirp z-transform algorithm
Rabiner, L., Schafer, R., & Rader, C. (1969) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1969.1162034 · Cited by 642
Brigham, E. O., & Morrow, R. E. (1967) · IEEE Spectrum · doi:10.1109/mspec.1967.5217220 · Cited by 588
Fast Fourier Transforms: for fun and profit
Gentleman, W. M., & Sande, G. (1966) · Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall) · doi:10.1145/1464291.1464352 · Cited by 542
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
The Application of Constrained Least Squares Estimation to Image Restoration by Digital Computer
Hunt, B. R. (1973) · IEEE Transactions on Computers · doi:10.1109/tc.1973.5009169 · Cited by 530
Nonlinear filtering of multiplied and convolved signals
Oppenheim, A. V., Schafer, R. W., & Stockham, T. G. (1968) · Proceedings of the IEEE · doi:10.1109/proc.1968.6570 · Cited by 506
Self-citationWhat is the fast Fourier transform?
Cochran, W., Cooley, J., Favin, D., Helms, H., Kaenel, R., Lang, W., Maling, G., Nelson, D., Rader, C., & Welch, P. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161899 · Cited by 490
A linear filtering approach to the computation of discrete Fourier transform
Bluestein, L. (1970) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1970.1162132 · Cited by 462
Modern techniques of power spectrum estimation
Bingham, C., Godfrey, M., & Tukey, J. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161895 · Cited by 426
An Adaptation of the Fast Fourier Transform for Parallel Processing
Pease, M. C. (1968) · Journal of the ACM · doi:10.1145/321450.321457 · Cited by 381
Ahmed, N., & Rao, K. R. (1975) · Orthogonal Transforms for Digital Signal Processing · doi:10.1007/978-3-642-45450-9_4 · Cited by 373
The Chirp z-Transform Algorithm and Its Application
Rabiner, L. R., Schafer, R. W., & Rader, C. M. (1969) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1969.tb04268.x · Cited by 344
Fast removal of non-uniform camera shake
Hirsch, M., Schuler, C. J., Harmeling, S., & Scholkopf, B. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126276 · Cited by 318
The acoustics, speech, and signal processing society - A historical perspective
Rabiner, L. (1984) · IEEE ASSP Magazine · doi:10.1109/massp.1984.1162225 · 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
Nonlinear filtering of multiplied and convolved signals
Oppenheim, A., Schafer, R., & Stockham, T. (1968) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1968.1161990 · Cited by 287
Self-citationFast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Number theoretic transforms to implement fast digital convolution
Agarwal, R. C., & Burrus, C. S. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9791 · Cited by 269
Fifty Years of Artificial Reverberation
Valimaki, V., Parker, J. D., Savioja, L., Smith, J. O., & Abel, J. S. (2012) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2012.2189567 · Cited by 213
Metadata
- Authors
- Stockham, T. G.
- Venue
- Proceedings of the April 26-28, 1966, Spring joint computer conference on XX - AFIPS '66 (Spring)
- Publisher
- ACM Press
- Published
- 1966
- Pages
- 229
- OpenAlex
- W2048332769
- Cited by
- 319
- References
- 2
- FWCI
- 2.99
- Type
- conference paper
- Language
- en
- Open access
- gold
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
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.