World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s
- 25 December 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (4) , 1507-1516
Abstract
This paper presents the fastest fast Fourier transform (FFT) hardware architectures so far. The architectures are based on a fully parallel implementation of the FFT algorithm. In order to obtain the highest throughput while keeping the resource utilization low, we base our design on making use of advanced shift-and-add techniques to implement the rotators and on selecting the most suitable FFT algorithms for these architectures. Apart from high throughput and resource efficiency, we also guarantee high accuracy in the proposed architectures. For the implementation, we have developed an automatic tool that generates the architectures as a function of the FFT size, input word length and accuracy of the rotations. We provide experimental results covering various FFT sizes, FFT algorithms, and field-programmable gate array boards. These results show that it is possible to break the barrier of 100 GS/s for FFT calculation.Keywords
Funding Information
- Swedish ELLIIT Program
This publication has 37 references indexed in Scilit:
- Design and Implementation of 256-Point Radix-4 100 Gbit/s FFT Algorithm into FPGA for High-Speed ApplicationsETRI Journal, 2015
- A Mixed-Decimation MDF Architecture for Radix- $2^{k}$ Parallel FFTIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2015
- Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)IEEE Transactions on Circuits and Systems I: Regular Papers, 2014
- Pipelined Radix-$2^{k}$ Feedforward FFT ArchitecturesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
- Search algorithms for the multiple constant multiplications problem: Exact and approximateMicroprocessors and Microsystems, 2010
- A Low-Complexity 128-Point Mixed-Radix FFT Processor for MB-OFDM UWB SystemsETRI Journal, 2010
- Multiplierless multiple constant multiplicationACM Transactions on Algorithms, 2007
- Multiplierless Implementation of Rotators and FFTsEURASIP Journal on Advances in Signal Processing, 2005
- ‘Split radix’ FFT algorithmElectronics Letters, 1984
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965