A recursive fast Fourier transformation algorithm

Author

Varkonyi-Koczy, Annamaria R.

Author_Institution

Dept. of Meas. & Instrum. Eng., Tech. Univ. Budapest

Volume

42

Issue

9

fYear

1995

fDate

9/1/1995 12:00:00 AM

Firstpage

614

Lastpage

616

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;

fLanguage

English

Journal_Title

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7130

Type

jour

DOI

10.1109/82.466641

Filename

466641