24 December 1980 Fourier Transform Faster Than Fast Fourier Transform (FFT)
Author Affiliations +
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.
© (1980) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chen-Hanson Ting, "Fourier Transform Faster Than Fast Fourier Transform (FFT)", Proc. SPIE 0241, Real-Time Signal Processing III, (24 December 1980); doi: 10.1117/12.959241; https://doi.org/10.1117/12.959241
PROCEEDINGS
7 PAGES


SHARE
Back to Top