AN EXPANDABLE COLUMN FFT ARCHITECTURE USING CIRCUIT SWITCHING-NETWORKS

被引:9
作者
CHEN, T [1 ]
ZHU, L [1 ]
机构
[1] COLORADO STATE UNIV,DEPT ELECT ENGN,FT COLLINS,CO 80523
来源
JOURNAL OF VLSI SIGNAL PROCESSING | 1993年 / 6卷 / 03期
关键词
D O I
10.1007/BF01608537
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Fast Fourier Transform (FFT) is widely used in various digital signal processing applications. The performance requirements for FFT in modern real-time applications has increased dramatically due to the high demand on capacity and performance of modern telecommunication systems, where FFT plays a major role. Software implementations of FFT running on a general purpose computer can no longer meet current speed requirements. However, recent advances in VLSI technology have made it possible to implement the entire FFT system on a single silicon substrate. This article presents a column FFT design suitable for ULSI (Ultra Large Scale Integration) implementations. The basic building block is a 64-point column FFT. FFTs with longer transform lengths can be easily realized using the 64-point column FFT building block. The butterfly processors in the column FFT are connected using circuit switching networks. The circuit switching networks not only provide dynamically reconfigurable interconnections among the butterfly processors, but also provide a fault-tolerant capability. Bit-serial arithmetic is used in the architecture. Assuming the data word length is 16 bits, the 1024-point column FFT engine proposed in this article is capable of processing 1024 complex data samples in 533 clock cycles. If the clock frequency is 40 MHz, it will take 13.3 mus to complete a 1024-point FFT.
引用
收藏
页码:243 / 257
页数:15
相关论文
共 15 条
  • [1] A GUIDED TOUR OF FAST FOURIER TRANSFORM
    BERGLAND, GD
    [J]. IEEE SPECTRUM, 1969, 6 (07) : 41 - +
  • [2] YIELD ESTIMATION FOR SERIAL SUPERCHIP
    CHEN, W
    MAVOR, J
    DENYER, PB
    RENSHAW, D
    [J]. IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1989, 136 (03): : 187 - 196
  • [3] TRAFFIC ROUTING ALGORITHM FOR SERIAL SUPERCHIP SYSTEM CUSTOMISATION
    CHEN, W
    MAVOR, J
    DENYER, PB
    RENSHAW, D
    [J]. IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES, 1990, 137 (01): : 65 - 73
  • [4] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES
    COOLEY, JW
    TUKEY, JW
    [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &
  • [5] Covert G. D., 1982, Proceedings of ICASSP 82. IEEE International Conference on Acoustics, Speech and Signal Processing, P1081
  • [6] DANIELSSON PE, 1983, IEEE T COMPUT, V32, P1067, DOI 10.1109/TC.1983.1676159
  • [7] DENYER P, 1985, VLSI SIGNAL PROCESSI
  • [8] A SINGLE CHIP RADIX-2 FFT BUTTERFLY ARCHITECTURE USING PARALLEL DATA DISTRIBUTED ARITHMETIC
    MACTAGGART, IR
    JACK, MA
    [J]. IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1984, 19 (03) : 368 - 373
  • [9] O'Brien J., 1989, 1989 IEEE International Solid-State Circuits Conference. Digest of Technical Papers. 36th ISSCC. First Edition (Cat. No.CH2684-9), P166, DOI 10.1109/ISSCC.1989.48244
  • [10] RABINER LR, 1975, THEORY APPLICATION D