Area-efficient memory-based architecture for FFT processing
Authors:
- 4 November 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 101
Abstract
In this paper, we propose a new area-efficient parallel architecture to calculate 2/sup n/-point FFT. The proposed architecture is based on the radix-4 Cooley-Tukey algorithm, and consists of four complex multipliers, eight complex adders, and four RAMs each of which is partitioned into two banks. The implemented FFT processor can calculate 2 K/4 K/8 K-point complex FFT in 28.2 /spl mu/s/62.0 /spl mu/s/135.2 /spl mu/s at 91 MHz, respectively.Keywords
This publication has 5 references indexed in Scilit:
- A low-power, high-performance, 1024-point FFT processorIEEE Journal of Solid-State Circuits, 1999
- A fast single-chip implementation of 8192 complex point FFTIEEE Journal of Solid-State Circuits, 1995
- Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division MultiplexingIEEE Transactions on Communications, 1985
- Data Transmission by Frequency-Division Multiplexing Using the Discrete Fourier TransformIEEE Transactions on Communication Technology, 1971
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965