Title :
A recursive fast Fourier transformation algorithm
Author :
Varkonyi-Koczy, Annamaria R.
Author_Institution :
Dept. of Meas. & Instrum. Eng., Tech. Univ. Budapest
fDate :
9/1/1995 12:00:00 AM
Abstract :
A new composite filter-bank structure is presented for the efficient implementation of the recursive discrete transformation. This structure is based on a proper combination of the concepts of polyphase filtering and the fast Fourier transformation (FFT) algorithm. Its computational complexity is in direct correspondence with the FFT, and can be operated both in sliding and block-oriented modes. The inherent parallelism of this structure enables very high speed in practical implementations
Keywords :
computational complexity; discrete Fourier transforms; filtering theory; recursive filters; block-oriented mode; composite filter-bank structure; computational complexity; fast Fourier transformation algorithm; polyphase filtering; recursive DFT; recursive FFT algorithm; recursive discrete transformation; sliding mode; Computational complexity; Discrete Fourier transforms; Feedback loop; Filtering algorithms; Frequency; Lagrangian functions; Parallel processing; Resonator filters; Sampling methods; Signal processing algorithms;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
