A radix-eight fast Fourier transform subroutine for real-valued series

1 June 1969

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Audio and Electroacoustics

Vol. 17 (2) , 138-144
https://doi.org/10.1109/tau.1969.1162043

Abstract

Fast Fourier analysis (FFA) and fast Fourier synthesis (FFS) algorithms are developed for computing the discrete Fourier transform of a real series, and for synthesizing a real series from its complex Fourier coefficients. A FORTRAN program implementing both algorithms is given in the Appendix.

Keywords

FAST FOURIER TRANSFORMS
ALGORITHMS
FREQUENCY
DISCRETE FOURIER TRANSFORMS
SAMPLING METHODS

This publication has 3 references indexed in Scilit:

Numerical Analysis: A fast fourier transform algorithm for real-valued series
Communications of the ACM, 1968
Modern techniques of power spectrum estimation
IEEE Transactions on Audio and Electroacoustics, 1967
An algorithm for the machine calculation of complex Fourier series
Mathematics of Computation, 1965