Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 
 

 

A fast Fourier transform algorithm using base $ 8$ iterations


Author: G. D. Bergland
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
Full-text PDF

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • [1] J. W. Cooley & J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comp., v. 19, 1965, pp. 297-301. MR 31 #2843. MR 0178586 (31:2843)
  • [2] W. M. Gentleman & G. Sande, "Fast Fourier transforms for fun and profit," Fall Joint Computer Conference Proceedings, Vol. 29, 1966, pp. 563-578.
  • [3] R. E. Miller & S. Winograd, Private Communication.
  • [4] G. D. Bergland, "The fast Fourier transform recursive equations for arbitrary length records," Math. Comp., v. 21, 1967, pp. 236-238. MR 0223120 (36:6169)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65.90

Retrieve articles in all journals with MSC: 65.90


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1968-0226899-X
Article copyright: © Copyright 1968 American Mathematical Society

American Mathematical Society