skip to main content
10.1145/1476589.1476612acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

Recursive Fast Fourier Transforms

Published: 09 December 1968 Publication History

Abstract

The development of the Fast Fourier Transform in complex notation has obscured the savings that can be made through the use of recursive properties of trigometric functions. A disadvantage of the Fast Fourier Transform is that all samples of the function must be stored in memory before processing can start. The computation in the Fast Fourier Transform occurs after the receipt of the last sample of the function; there is no processing of the incoming data prior to this point. Thus if there are N samples of each function, and G different functions (in G "gates" or "channels"), then a total of GN words must be stored in memory.

References

[1]
G Goertzel An algorithm for the evaluation of finite trigonometric series American Math Monthly January 1958 p 34
[2]
J W Cooley J W Tukey An algorithm for the machine calculation of complex Fourier series Math of Comput Volume 19 April 1965 p 297--301

Cited By

View all
  • (1969)A short bibliography on the fast Fourier transformIEEE Transactions on Audio and Electroacoustics10.1109/TAU.1969.116204017:2(166-169)Online publication date: Jun-1969

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '68 (Fall, part I): Proceedings of the December 9-11, 1968, fall joint computer conference, part I
December 1968
931 pages
ISBN:9781450378994
DOI:10.1145/1476589
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 1968

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

AFIPS '68 (Fall, part I)
Sponsor:
  • AFIPS
December 9 - 11, 1968
California, San Francisco

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)169
  • Downloads (Last 6 weeks)16
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (1969)A short bibliography on the fast Fourier transformIEEE Transactions on Audio and Electroacoustics10.1109/TAU.1969.116204017:2(166-169)Online publication date: Jun-1969

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media