管道(软件)
计算机科学
快速傅里叶变换
管道运输
并行计算
分裂基FFT算法
数字信号处理
加法器
计算机硬件
旋转因子
Cooley–Tukey FFT算法
素因子FFT算法
作者
Shousheng He,M. Torkelson
出处
期刊:International Conference on Parallel Processing
日期:1996-04-15
卷期号:: 766-770
被引量:345
标识
DOI:10.1109/ipps.1996.508145
摘要
A new VLSI architecture for a real-time pipeline FFT processor is proposed. A hardware-oriented radix-2/sup 2/ algorithm is derived by integrating a twiddle factor decomposition technique in the divide-and-conquer approach. The radix-2/sup 2/ algorithm has the same multiplicative complexity as the radix-4 algorithm, but retains the butterfly structure of the radix-2 algorithm. The single-path delay-feedback architecture is used to exploit the spatial regularity in the signal flow graph of the algorithm. For length-N DFT computation, the hardware requirement of the proposed architecture is minimal on both dominant components: log/sub 4/N-1 complexity multipliers and N-1 complexity data memory. The validity and efficiency of the architecture have been verified by simulation in the hardware description language VHDL.
科研通智能强力驱动
Strongly Powered by AbleSci AI