Journal ArticleDOI
Real-time FFT algorithm applied to on-line spectral analysis
Pei-Chen Lo,Yu-Yun Lee +1 more
TLDR
This paper presents a new method of implementing the fast Fourier transform (FFT) algorithm that efficiently utilizes computer time to perform the FFT computation while data acquisition proceeds so that local butterfly modules are built using the data points that are already available.Abstract:
On-line running spectral analysis is of considerable interest in many electrophysiological signals, such as the EEG (electroencephalograph). This paper presents a new method of implementing the fast Fourier transform (FFT) algorithm. Our "real-time FFT algorithm" efficiently utilizes computer time to perform the FFT computation while data acquisition proceeds so that local butterfly modules are built using the data points that are already available. The real-time FFT algorithm is developed using the decimation-in-time split-radix FFT (DIT sr-FFT) butterfly structure. In order to demonstate the synchronization ability of the proposed algorithm, the authors develop a method of evaluating the number of arithmetic operations that it requires. Both the derivation and the experimental result show that the real-time FFT algorithm is superior to the conventional whole-block FFT algorithm in synchronizing with the data acquisition process. Given that the FFT sizeN=2 r , real-time implementation of the FFT algorithm requires only 2/r the computational time required by the whole-block FFT algorithm.read more
Citations
More filters
Proceedings ArticleDOI
An efficient FFT algorithm based on building on-line butterfly sub-structure
Yu-Yun Lee,Pei-Chen Lo +1 more
TL;DR: 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, is presented.
Proceedings ArticleDOI
A novel approach for DFT computation
TL;DR: This novel method utilizing the concept of radix-4 decimation in time FFT algorithm instead of a divide and conquer method to compute the DFT in a systematic manner is an effective, easy and systematic way of computing DFT.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Book
Discrete-Time Signal Processing
TL;DR: In this paper, the authors provide a thorough treatment of the fundamental theorems and properties of discrete-time linear systems, filtering, sampling, and discrete time Fourier analysis.
Journal ArticleDOI
`Split radix' FFT algorithm
TL;DR: A new N = 2n fast Fourier transform algorithm is presented, which has fewer multiplications and additions than radix 2n, n = 1, 2, 3 algorithms, has the same number of multiplications as the Raderi-Brenner algorithm, but much fewer additions.
Journal ArticleDOI
Implementation of "Split-radix" FFT algorithms for complex, real, and real-symmetric data
TL;DR: This algorithm belongs to that class of recently proposed 2n-FFT's which present the same arithmetic complexity (the lowest among any previously published one) and can easily be applied to real and real-symmetric data with reduced arithmetic complexity by removing all redundancy in the algorithm.
Journal Article
FFT pruning
TL;DR: It is shown that for situations in which the relative number of zero-valued samples is quite large, significant time-saving can be obtained by pruning the FFT algorithm.