Efficient FFT algorithm based on building on-line butterfly sub-structure

Yu Yun Lee*, Pei-Chen Lo

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish
Pages97-100
Number of pages4
DOIs
StatePublished - 1 Dec 1998
EventProceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98 - Beijing, China
Duration: 12 Oct 199816 Oct 1998

Conference

ConferenceProceedings of the 1998 4th International Conference on Signal Processing Proceedings, ICSP '98
CityBeijing, China
Period12/10/9816/10/98

Fingerprint Dive into the research topics of 'Efficient FFT algorithm based on building on-line butterfly sub-structure'. Together they form a unique fingerprint.

Cite this