A Recursive Fast Fourier Transformation Algorithm

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

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
Volume42
Issue number9
DOIs
Publication statusPublished - 1995

Fingerprint

Filter banks
Computational complexity
Composite materials

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

@article{621dcf5d317540e48bd537effe6122c8,
title = "A Recursive Fast Fourier Transformation Algorithm",
abstract = "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.",
author = "A. V{\'a}rkonyi-K{\'o}czy",
year = "1995",
doi = "10.1109/82.466641",
language = "English",
volume = "42",
pages = "614--616",
journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",
issn = "1057-7130",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - A Recursive Fast Fourier Transformation Algorithm

AU - Várkonyi-Kóczy, A.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029373887&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029373887&partnerID=8YFLogxK

U2 - 10.1109/82.466641

DO - 10.1109/82.466641

M3 - Article

AN - SCOPUS:0029373887

VL - 42

SP - 614

EP - 616

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1057-7130

IS - 9

ER -