Run-Time Reconfigurable FFT Engine
Abstract
This paper develops a system level architecture for implementing a cost-efficient, FPGA-based realtime FFT engine. This approach considers both the hardware cost (in terms of FPGA resource requirements), and performance (in terms of throughput). These two dimensions are optimized based on using run time reconfiguration, double buffering technique and the hardware virtualization to reuse the available processing components. The system employs sixteen reconfigurable parallel FFT cores. Each core represents a 16 complex point parallel FFT processor, running in continuous realtime FFT engine. The architecture support transform length of 256 complex points, as a demonstrator to the idea design, using fixed-point arithmetic and has been developed using radix-4 architecture. The parallel Booth technique for realizing the complex multiplier (required in the basic butterfly operation) is chosen. That is to save a lot of hardware compared to other techniques. The simulation results that have been performed using VHDL modeling language and ModelSim software
shows that the full design can be implemented using single FPGA platform requiring about 50,000 Slices.
Author(s) Rights
- Each author retains the right to use the work for non-commercial purposes as well as for further research and spoken presentations.
- Each author retains the right to use the illustrations and research data in his/her future work.
- Only one offprint is provided free for each author. The authors can order offprints at the proof stage at certain rates depending on the number of additional copies required and the year of publication.
Publisher Rights
The publisher of the journal has full rights for publication of the submitted manuscripts, electronic and facsimile formats and for electronic capture, reproduction and licensing in all formats now and in perpetuity in the original and all derivative works.
