Greedy Vector Approximation Based on Rotation for Multiplierless Complex Products
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).
Authors
- Paulo S. R. Diniz (ORCID: https://orcid.org/0000-0002-1272-7368)
- Luiz F. da S. Coelho
- Didier Le Ruyet
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24829
- Primary Topic
- Digital Filter Design and Implementation
- Type
- preprint