Fourier Transform Faster Than Fast Fourier Transform (FFT)

Chen-Hanson Ting

doi:10.1117/12.959241

24 December 1980 Fourier Transform Faster Than Fast Fourier Transform (FFT)

Chen-Hanson Ting

Proceedings Volume 0241, Real-Time Signal Processing III; (1980) https://doi.org/10.1117/12.959241
Event: 24th Annual Technical Symposium, 1980, San Diego, United States

Abstract

Because of the rapid advances in multiplication hardware, the most time consuming processing step in Fourier Transform will be the number of memory accesses rather than the number of multiplications. An algorithm of Continuous Fourier Transform (CFT) which minimizes memory access was developed. It can be implemented with existing technology and is potentially faster than FFT, particularly for processing continuous, real-time signals.

Citation Download Citation

Chen-Hanson Ting "Fourier Transform Faster Than Fast Fourier Transform (FFT)", Proc. SPIE 0241, Real-Time Signal Processing III, (24 December 1980); https://doi.org/10.1117/12.959241

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available