Fourier Transform Computers Using CORDIC Iterations
IEEE Transactions on Computers
A high throughput FFT processor with no multipliers
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
An effective memory addressing scheme for FFT processors
IEEE Transactions on Signal Processing
An Area-Efficient FFT Architecture for OFDM Digital Video Broadcasting
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
This paper presents a pipelined, reduced memory and low power CORDIC-based architecture for fast Fourier transform implementation. The proposed algorithm utilizes a new addressing scheme and the associated angle generator logic in order to remove any ROM usage for storing twiddle factors. As a case study, the radix-2 and radix-4 FFT algorithms have been implemented on FPGA hardware. The synthesis results match the theoretical analysis and it can be observed that more than 20% reduction can be achieved in total memory logic. In addition, the dynamic power consumption can be reduced by as much as 15% by reducing memory accesses.