A high throughput FFT processor with no multipliers
Authors:
- 1 October 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636404,p. 485-490
Abstract
A novel technique for implementing very high speed FFTs based on unrolled CORDIC structures is proposed in this paper. There has been a lot of research in the area of FFT algorithm implementation; most of the research is focused on reduction of the computational complexity by selection and efficient decomposition of the FFT algorithm. However there has not been much research on using the CORDIC structures for FFT implementations, especially for large, high speed and high throughput FFT transforms, due to the recursive nature of the CORDIC algorithms. The key ideas in this paper are replacing the sine and cosine twiddle factors in the conventional FFT architecture by non-iterative CORDIC micro-rotations which allow substantial (~50%) reduction in read-only memory (ROM) table size, and total removal of complex multipliers. A new method to derive the optimal unrolling/unfolding factor for a desired FFT application based on the MSE (mean square error) is also proposed in this paper. Implemented on a Virtex-4 FPGA, the CORDIC based FFT runs 3.9 times faster and occupies 37% less area than an equivalent complex multiplier-based FFT implementation.Keywords
This publication has 14 references indexed in Scilit:
- Balanced Binary-Tree Decomposition for Area-Efficient Pipelined FFT ProcessingIEEE Transactions on Circuits and Systems I: Regular Papers, 2007
- Area/Delay Efficient Recoding Methods for Parallel CORDIC Rotations2006
- A 64-Point Fourier Transform Chip for High-Speed Wireless LAN Application Using OFDMIEEE Journal of Solid-State Circuits, 2004
- A high-speed FFT processor for OFDM systems2003
- Versatile COFDM demodulator design based on the CORDIC-algorithmIEEE Transactions on Consumer Electronics, 2002
- High performance rotation architectures based on the radix-4 CORDIC algorithmIEEE Transactions on Computers, 1997
- The CORDIC algorithm: new results for fast VLSI implementationIEEE Transactions on Computers, 1993
- Very Fast Fourier Transform Algorithms Hardware for ImplementationIEEE Transactions on Computers, 1979
- Fourier Transform Computers Using CORDIC IterationsIEEE Transactions on Computers, 1974
- The CORDIC Trigonometric Computing TechniqueIRE Transactions on Electronic Computers, 1959