Key points are not available for this paper at this time.
The fast Fourier transform (FFT) is a widely used algorithm for computing the discrete Fourier transform (DFT) in real-time signal processing. Achieving high performance with minimal resource usage is crucial for any real-time application. This paper introduces an architecture based on coordinate rotation digital computer (CORDIC) for implementing a radix-Formula: see text FFT. Traditional FFT implementations require complex twiddle factor multiplications, which is not cost-effective in terms of hardware utilization. To address this issue, we have proposed a radix-8 CORDIC-based approach integrated with FFT computation. The proposed radix-8 CORDIC requires fewer stages than the conventional radix-2 CORDIC, enhancing computational efficiency and reducing hardware utilization. The feedforward radix-Formula: see text FFT architecture is presented where the butterflies of the FFT are computed with the help of radix-8 CORDIC. A total of three FFT architectures are developed supporting 16-, 1024- and 2048-point FFTs. The proposed FFT architectures are developed using Verilog-HDL code and implemented on a Virtex-7 field-programmable gate array (FPGA). The FPGA-based radix-Formula: see text FFT achieves a clock frequency of 323.4Formula: see textMHz and utilizes minimal FPGA resources. Processing of 2048 data samples takes only 4.06Formula: see textFormula: see textS by the proposed FPGA-based design. Additionally, two ASICs have been designed: the 1024-point FFT ASIC occupies an area of 1.079Formula: see textmm 2 , and the 2048-point FFT ASIC occupies an area of 1.544 mm 2 . The proposed FFT ASICs have better-normalized area per FFT and energy per FFT than the state-of-the-art designs.
Building similarity graph...
Analyzing shared references across papers
Loading...
Kaushik Das
National Institute of Technology Jamshedpur
Sambhu Nath Pradhan
National Institute of Technology Agartala
Abhishek Bhattacharjee
National Institute of Technology Agartala
Journal of Circuits Systems and Computers
GLA University
National Institute of Technology Agartala
Building similarity graph...
Analyzing shared references across papers
Loading...
Das et al. (Fri,) studied this question.
synapsesocial.com/papers/68e60795b6db64358759b377 — DOI: https://doi.org/10.1142/s0218126625500082