The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Fast Fourier Transforms: for fun and profit
Open accessAbstract
The "Fast Fourier Transform" has now been widely known for about a year. During that time it has had a major effect on several areas of computing, the most striking example being techniques of numerical convolution, which have been completely revolutionized. What exactly is the "Fast Fourier Transform"?
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
Rounding errors in algebraic processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90390-4 · Cited by 1,315
Fisher, A., Whittaker, E. T., & Blackie, G. R. (1924) · Journal of the American Statistical Association · doi:10.2307/2277387 · Cited by 731
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
Hockney, R. W. (1965) · Journal of the ACM · doi:10.1145/321250.321259 · Cited by 683
High-speed convolution and correlation
Stockham, T. G. (1966) · Proceedings of the April 26-28, 1966, Spring joint computer conference on XX - AFIPS '66 (Spring) · doi:10.1145/1464182.1464209 · Cited by 319
Some Practical Considerations in the Realization of Linear Digital Filters
(1969) · The MIT Press eBooks · doi:10.7551/mitpress/5222.003.0006 · Cited by 59
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
“Technically, the asymptotically optimal “cache-oblivious” recursive algorithm would use a radix of for a transform of size , analogous to the “four-step” algorithm [18], [38], but we have found that a bounded radix generally works better in practice, except for at most a single step of radix-.”
MethodNumerical Inversion of Laplace Transforms: An Efficient Improvement to Dubner and Abate's Method
Durbin, F. (1974) · The Computer Journal · doi:10.1093/comjnl/17.4.371 · Cited by 1,157
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
Ducas, L., & Micciancio, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_24 · Cited by 745
A guided tour of the fast Fourier transform
Bergland, G. D. (1969) · IEEE Spectrum · doi:10.1109/mspec.1969.5213896 · Cited by 673
Brigham, E. O., & Morrow, R. E. (1967) · IEEE Spectrum · doi:10.1109/mspec.1967.5217220 · Cited by 588
The Fast Fourier Transform and Its Applications
Cooley, J. W., Lewis, P. A. W., & Welch, P. D. (1969) · IEEE Transactions on Education · doi:10.1109/te.1969.4320436 · Cited by 573
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
What 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
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
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
“of the trigonometric constants (“twiddle factors” [13]) in subtransforms of the DFT decomposition (while the final FFT re-”
BackgroundA Full RNS Variant of Approximate Homomorphic Encryption
Cheon, J. H., Han, K., Kim, A., Kim, M., & Song, Y. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-10970-7_16 · Cited by 357
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
The Fractional Fourier Transform and Applications
Bailey, D. H., & Swarztrauber, P. N. (1991) · SIAM Review · doi:10.1137/1033097 · Cited by 333
Effects of finite register length in digital filtering and the fast Fourier transform
Oppenheim, A. V., & Weinstein, C. J. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8820 · Cited by 305
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
FFTs in external or hierarchical memory
Bailey, D. H. (1990) · The Journal of Supercomputing · doi:10.1007/bf00162341 · Cited by 290
Post-Quantum Lattice-Based Cryptography Implementations: A Survey
Nejatollahi, H., Dutt, N., Ray, S., Regazzoni, F., Banerjee, I., & Cammarota, R. (2019) · ACM Computing Surveys · doi:10.1145/3292548 · Cited by 277
Markel, J. (1971) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1971.1162205 · Cited by 274
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
Longa, P., & Naehrig, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-48965-0_8 · Cited by 268
Fourier Transform Computers Using CORDIC Iterations
Despain, A. M. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223800 · Cited by 264
Metadata
- Authors
- Gentleman, W. M., & Sande, G.
- Venue
- Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall)
- Publisher
- ACM Press
- Published
- 1966
- Pages
- 563
- OpenAlex
- W2069441027
- Cited by
- 542
- References
- 7
- FWCI
- 3.66
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.