Low‐complexity, energy‐efficient fully parallel split‐radix FFT architecture
Authors:
Open Access
- 18 July 2022
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 58 (18) , 678-680
Abstract
Fully parallel pipelined fast Fourier transform offers the highest throughput but requires high area and power. In this work, an efficient fast Fourier transform processor based on the split‐radix algorithm is presented to reduce the hardware complexity of fully parallel fast Fourier transforms. In fully parallel pipelined implementations, split‐radix fast Fourier transform requires considerably more registers compared to other fast Fourier transform algorithms leading to more power consumption and high latency in spite of having the least number of multiplications among all fast Fourier transforms. To address this issue, the authors present a new data‐flow graph with no non‐trivial twiddle factors in the odd stages of the split‐radix fast Fourier transform. This facilitates significant reduction in the number of pipelining registers and a lower latency is achieved. Further, an efficient shift‐add twiddle factor multiplier is proposed based on architectural analysis and substructure sharing. A comparison of the proposed design with existing fully parallel fast Fourier transforms is carried out and it is found that the proposed method outperforms other designs. Synthesis results show that the proposed design offers 45–57% area savings and 67–74% energy savings compared to the best existing fully parallel fast Fourier transform design.Keywords
This publication has 8 references indexed in Scilit:
- SMUL-FFT: A Streaming Multiplierless Fast Fourier TransformIEEE Transactions on Circuits and Systems II: Express Briefs, 2021
- Evolution of the Performance of Pipelined FFT Architectures Through the Years2020
- Towards design and automation of a scalable split-radix FFT processor for high throughput applicationsMicroprocessors and Microsystems, 2019
- World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/sIEEE Transactions on Circuits and Systems I: Regular Papers, 2018
- Design and Implementation of 256-Point Radix-4 100 Gbit/s FFT Algorithm into FPGA for High-Speed ApplicationsETRI Journal, 2015
- Pipelined Parallel FFT Architectures via Folding TransformationIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
- A high-speed four-parallel radix-24 FFT/IFFT processor for UWB applications2008
- Scheme for Reducing the Storage Requirements of FFT Twiddle Factors on FPGAsJournal of Signal Processing Systems, 2007