General
Greedy Vector Approximation Based on Rotation for Multiplierless Complex Products
arXiv eess.SP0 views
arXiv:2611.24829v1 Announce Type: new 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).
Source:https://arxiv.org/abs/2611.24829PreviousSpectrally Correlated Frequency Spreading Codes for FRESH Filtering-based Interference CancellationNextCompute Before You Digitize: ADC-less Mixed-Signal Processing for Scalable Cryogenic Qubit Readout
Related posts

How to Generate Synthetic Healthcare Data Using Synthea: A Hands On Tutorial
0freeCodeCamp
Visa, Mastercard and JPMorgan Customer Data Leaked by Hackers
0Hacker News
My Journey as a Fresh Software Engineering Student at YIBS Starting my academic journey at Yaoundé International Business School (YIBS) as a fresh Software Engineering student is an exciting experien
0dev.to Beginners

Announcing custom execution roles for AWS CloudFormation StackSets
0AWS DevOps Blog
To All the Folks Who Are About to Be Rich
0Hacker News New
I recreated the WORLD in Minecraft at 1:1 scale
0Hacker News New