Work

Greedy Vector Approximation Based on Rotation for Multiplierless Complex Products

Year: 2026
Type: preprint
Abstract: This paper proposes a greedy approximation algorithm for performing complex-valued inner products in multiplierless hardware. The matching pursuits for accurate rotation approximation (MPARA) algorithm approximates the tangent of the phase of complex elements as a sum of signed powers of two (SOPOT) representation, enabling multiplierless hardware for complex-valued multiplication. The proposed algorithm outperforms other state-of-the-art approximation methods for approximating the twiddle factors of a fast Fourier transform (FFT).
Language: English
Open Access status: green
OpenAlex ID: W7236710685
Cites: 13
Cited by:
Related to: 10