A New Input Grouping and Sharing Method to Design Low Complexity FFT Implementation

FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2024-02, Vol.71 (2), p.832-836
Main Authors: Wang, Shouman, Chen, Jiajia
Format: Article
Language:English
Subjects:
Adders
Algorithms
Complexity
Complexity theory
Computer architecture
Costs
Digital signal processing
Discrete Fourier transforms
FFT
IP networks
Logic synthesis
Merging
partial sum sharing
twiddle factors
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:FFT is a commonly applied algorithm in digital signal processing and communications. In this brief, a new low power and low complexity FFT architecture design is proposed. An input grouping method is used to reduce the multiplications of the inputs and FFT twiddle factor coefficients. In addition, a new input partial sum sharing scheme is proposed to reuse the hardware resources to further reduce the adder cost. Logic synthesis results in ASIC show that the proposed 16-point FFT architecture can save area and power cost by at least 19.1% and 19.0% respectively compared with the recently published designs. Similarly, the proposed 32-point FFT architecture can reduce both power and delay by at least 6.91% and 5.35%.
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2022.3188255