A RECURSIVE FAST FOURIER TRANSFORMATION ALGORITHM

被引：23
|
作者：
VARKONYIKOCZY, AR
机构：
[1] Department of Measurement and Instrument Engineering of the Technical University of Budapest
来源：
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING | 1995年 / 42卷 / 09期
基金：
匈牙利科学研究基金会;
关键词：
D O I：
10.1109/82.466641
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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 last 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.
引用
收藏
页码：614 / 616
页数：3
相关论文
共 50 条
12345