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

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.