By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bergland, G. ; Bell Telephone Laboratories, Inc. Whippany, N.J.

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.

Published in:

Audio and Electroacoustics, IEEE Transactions on  (Volume:17 ,  Issue: 2 )