Fourier Transform Faster Than Fast Fourier Transform (FFT)
Chen‐Hanson Ting · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1980
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.