A versatile VLSI fast Fourier transform processor

Authors:
Kuang-Cheng Ting;Chuan-Lin Wu
Affiliations:
University of Texas at Austin, Austin, Texas;University of Texas at Austin, Austin, Texas
Venue:
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
Year:
1984

Citing 10
Cited 0

An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Notes on Shuffle/Exchange-Type Switching Networks

IEEE Transactions on Computers
Quotient Networks

IEEE Transactions on Computers
Star: A Local Network System for Real-Time Management of Imagery Data

IEEE Transactions on Computers
Wavefront Array Processor: Language, Architecture, and Applications

IEEE Transactions on Computers
A Pipeline Fast Fourier Transform

IEEE Transactions on Computers
Why Systolic Architectures?

Computer
The cube-connected-cycles: A versatile network for parallel computation

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Fast Fourier Transforms: for fun and profit

AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A versatile special-purpose VLSI fast Fourier transform (FFT) processor is presented. It can process variant data sizes of FFT and cooperate with other identical FFT processors to accomplish cascade and parallel FFT processing schemes. The operations of the single processor FFT processing scheme, the multiprocessor cascade FFT processing scheme, and the multiprocessor parallel FFT processing scheme are described. The results of performance analysis show that the combination of adaptive architecture capability and VLSI technology can provide a practical solution for meeting the goal of advanced real-time FFT processing.