Share Email Print

Proceedings Paper

Fourier Transform Faster Than Fast Fourier Transform (FFT)
Author(s): Chen-Hanson Ting
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 24 December 1980
PDF: 7 pages
Proc. SPIE 0241, Real-Time Signal Processing III, (24 December 1980); doi: 10.1117/12.959241
Show Author Affiliations
Chen-Hanson Ting, Lockheed Missiles and Space Company (United States)

Published in SPIE Proceedings Vol. 0241:
Real-Time Signal Processing III
Tien F. Tao, Editor(s)

© SPIE. Terms of Use
Back to Top