This paper presents a new method of implementing the fast Fourier transform (FFT), the `real-time FFT algorithm', which efficiently utilizes the computer time to perform the FFT computation while the data acquisition proceeds. The main idea is to build the local butterfly modules using the data points available. The algorithm is based on the decimation-in-time split-radix FFT (DIT sr-FFT) butterfly structure. The algorithm is superior to the conventional whole-block FFT algorithm in synchronizing with the on-line process. The time delay is about 2/r that of the whole-block algorithm considering the FFT size N = 2r.
|Number of pages||4|
|State||Published - 1 Dec 1998|
|Event||Proceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98 - Beijing, China|
Duration: 12 Oct 1998 → 16 Oct 1998
|Conference||Proceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98|
|Period||12/10/98 → 16/10/98|