A new VLSI-oriented FFT algorithm and implementation
Authors:
- Yonghong GaoYGYonghong Gao
- Jouni IsoahoJIJouni Isoaho
- Hannu TenhunenHTHannu Tenhunen
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10630988,p. 337-341
Abstract
In this paper, we present a new VLSI-oriented fast Fourier transform (FFT) algorithm-radix-2/4/8, which can effectively minimize the number of complex multiplications. This algorithm can be implemented efficiently using a pipelined architecture. Based on this pipelined architecture, an 8 K FFT ASIC is designed for use in the DVB (Digital Video Broadcasting) application in 0.6 /spl mu/m-3.3 V triple-metal CMOS process.Keywords
This publication has 7 references indexed in Scilit:
- A fast single-chip implementation of 8192 complex point FFTIEEE Journal of Solid-State Circuits, 1995
- Split-radix algorithms for length-p/sup m/ DFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- On hardware implementation of the split-radix FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- A radix 4 delay commutator for fast Fourier transform processor implementationIEEE Journal of Solid-State Circuits, 1984
- Pipeline and Parallel-Pipeline FFT Processors for VLSI ImplementationsIEEE Transactions on Computers, 1984
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- Parallel pipeline fast fourier transformerIEE Proceedings F Communications, Radar and Signal Processing, 1983