A fast Fourier transform algorithm using base $8$ iterations
HTML articles powered by AMS MathViewer
- by G. D. Bergland PDF
- Math. Comp. 22 (1968), 275-279 Request permission
References
- James W. Cooley and John W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp. 19 (1965), 297–301. MR 178586, DOI 10.1090/S0025-5718-1965-0178586-1 W. M. Gentleman & G. Sande, "Fast Fourier transforms for fun and profit," Fall Joint Computer Conference Proceedings, Vol. 29, 1966, pp. 563–578. R. E. Miller & S. Winograd, Private Communication.
- G. D. Bergland, The fast Fourier transform recursive equations for arbitrary length records, Math. Comp. 21 (1967), 236–238. MR 223120, DOI 10.1090/S0025-5718-1967-0223120-2
Additional Information
- © Copyright 1968 American Mathematical Society
- Journal: Math. Comp. 22 (1968), 275-279
- MSC: Primary 65.90
- DOI: https://doi.org/10.1090/S0025-5718-1968-0226899-X
- MathSciNet review: 0226899