A Novel Architecture of Area Efficient FFT Algorithm for FPGA Implementation
Atin Mukherjee, Amitabha Sinha, Debesh Choudhury

TL;DR
This paper introduces an area-efficient FFT architecture for FPGA that reuses butterfly elements, reducing hardware area significantly with minimal impact on processing time, validated through VHDL simulation and FPGA implementation.
Contribution
A novel FFT architecture that reuses butterfly units to minimize FPGA area usage while maintaining performance, outperforming conventional designs.
Findings
Area reduced by a factor of log_N 2
Validated on Virtex-6 FPGA
Negligible increase in processing time
Abstract
Fast Fourier transform (FFT) of large number of samples requires huge hardware resources of field programmable gate arrays (FPGA), which needs more area and power. In this paper, we present an area efficient architecture of FFT processor that reuses the butterfly elements several times. The FFT processor is simulated using VHDL and the results are validated on a Virtex-6 FPGA. The proposed architecture outperforms the conventional architecture of a -point FFT processor in terms of area which is reduced by a factor of with negligible increase in processing time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Filter Design and Implementation · Numerical Methods and Algorithms · Advancements in PLL and VCO Technologies
