Low-Power Radix-22 FFT Processor with Hardware-Optimized Fixed-Width Multipliers and Low-Voltage Memory Buffers

In this paper, we propose a novel low-power implementation of the radix-22 Fast Fourier Transform (FFT) processor that exploits optimized multiplications and low-voltage memory buffers. The FFT computation requires complex products between input samples and precomputed coefficients, known as twiddle factors, as well as a large number of memory elements to store intermediate signals. To reduce power consumption, we bypass multiplications when twiddle factors are equal to zero or one. Furthermore, we introduce a fixed-width technique that lowers multiplier complexity for non-trivial coefficients by pruning the least significant columns of the partial product matrix and discarding the most significant partial products with low activation probability. To further minimize power consumption, we lower the supply voltage of memory buffers, creating two power domains in the design. Post-synthesis analysis in 28 nm technology shows that the proposed FFT achieves superior SNR and MSE compared to existing implementations, with reductions of 33% in power consumption and 30% in the power-delay product. In an OFDM receiver, the design also achieves optimal bit error rate performance under various levels of channel noise.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2025-10-28
DOI
https://doi.org/10.3390/electronics14214217
Primary Topic
Digital Filter Design and Implementation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low-Power Radix-22 FFT Processor with Hardware-Optimized Fixed-Width Multipliers and Low-Voltage Memory Buffers

Davide De, A.G.M. Strollo, Cristina Perna, Gennaro Di Meo
Electronics
Digital Filter Design and Implementation
article

Low-Power Radix-22 FFT Processor with Hardware-Optimized Fixed-Width Multipliers and Low-Voltage Memory Buffers

Davide De, A.G.M. Strollo, Cristina Perna, Gennaro Di Meo
article en

Abstract

In this paper, we propose a novel low-power implementation of the radix-22 Fast Fourier Transform (FFT) processor that exploits optimized multiplications and low-voltage memory buffers. The FFT computation requires complex products between input samples and precomputed coefficients, known as twiddle factors, as well as a large number of memory elements to store intermediate signals. To reduce power consumption, we bypass multiplications when twiddle factors are equal to zero or one. Furthermore, we introduce a fixed-width technique that lowers multiplier complexity for non-trivial coefficients by pruning the least significant columns of the partial product matrix and discarding the most significant partial products with low activation probability. To further minimize power consumption, we lower the supply voltage of memory buffers, creating two power domains in the design. Post-synthesis analysis in 28 nm technology shows that the proposed FFT achieves superior SNR and MSE compared to existing implementations, with reductions of 33% in power consumption and 30% in the power-delay product. In an OFDM receiver, the design also achieves optimal bit error rate performance under various levels of channel noise.

ElectronicsVol. 14(21)
University of Naples Federico II (IT)
Openalex Percentile: Top 60%
Digital Filter Design and Implementation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Low-Power Radix-22 FFT Processor with Hardware-Optimized Fixed-Width Multipliers and Low-Voltage Memory Buffers — Davide De, A.G.M. Strollo, et al. · Electronics (2025) | TGRS Research Map | TGRS