A Recursive Fast Fourier Transformation Algorithm

Research output: Contribution to journalArticle

30 Citations (Scopus)


In this letter 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.

Original languageEnglish
Pages (from-to)614-616
Number of pages3
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Issue number9
Publication statusPublished - Sep 1995

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Recursive Fast Fourier Transformation Algorithm'. Together they form a unique fingerprint.

  • Cite this