A generator of memory-based, runtime-reconfigurable 2N3M5K FFT engines
Angie Wang, Jonathan Bachrach, Borivoje Nikolic
Abstract
Runtime-reconfigurable, mixed-radix FFT/IFFT engines are essential for modern wireless communication systems. To comply with varying standards requirements, these engines are customized for each modem. The Chisel hardware construction language has been used in this work to create a generator of runtime-reconfigurable 2n3m5k FFT engines targeting software-defined radios (SDR) for modern communications, but with flexibility to support a wide range of applications. The generator uses a conflict-free, in-place, multi-bank SRAM design, and exploits the duality of decimation-in-frequency (DIF) and decimation-in-time (DIT) FFTs to support continuous data flow with only 2N memory blocks. DFT decomposition using the prime-factor algorithm (PFA) followed by the Cooley-Tukey algorithm (CTA) reduces twiddle ROM sizes. A programmable Winograd's Fourier Transform (WFTA) butterfly supporting radix-2/3/4/5/7 operations reuses radix-7 hardware to support reconfigurability with minimal area penalty. The generated FFTs use 50% less memory than iterative FFTs from Spiral. The twiddle ROM size of the generated LTE/WiFi FFT engine is 16% smaller than that of a 2048-pt Spiral design.
BibTeX
@inproceedings{icassp2016_ageneratorofmemo,
title = {A generator of memory-based, runtime-reconfigurable 2N3M5K FFT engines},
author = {Angie Wang and Jonathan Bachrach and Borivoje Nikolic},
booktitle = {ICASSP 2016},
year = {2016}
}