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
If nobody writes it down, it did not get decided
0dev.to Productivity
Micrograph B-factor estimation via Wilson statistics
0arXiv eess.IV
Toward Massive MIMO HAPS Networks: Antenna Architectures and Design
0arXiv eess.SP
Deep-Learning-Assisted Full Waveform Inversion for Attenuation Reconstruction in Ultrasound Computed Tomography
0arXiv eess.SP
Two is better than one: optimizing binary rating scales for online platforms
0arXiv cs.MA
Sparse Fault Detection in Linear Systems: Equivalence of GLR Tests and $\ell_1$-regularized Least Squares
0arXiv stat.TH