A Low-Complexity and High-Resolution Algorithm for the Magnitude Approximation of Complex Numbers.
Luca Fanucci, Massimo Rovini · CINECA IRIS Institutial research information system (University of Pisa) · 2002
In this paper a low-complexity and high-resolution algorithm to estimate the magnitude of complex numbers is presented. Starting from a review of previous art, the new algorithm has been derived to improve precision performance without any penalty in hardware complexity. As a case example, a semi-custom VLSI implementation for 10 bit 2's complement input data has been performed. A mean square error arid mean error performance improvement of nearly one order of magnitude has been demonstrated for an hardware complexity increase of roughly 34% with respect to previously presented solutions.