A Low-Complexity and High-Resolution Algorithm for the Magnitude Approximation of Complex Numbers

Luca FANUCCI  Massimo ROVINI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E85-A   No.7   pp.1766-1769
Publication Date: 2002/07/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: VLSI Design Technology and CAD
complex number,  magnitude approximation,  power estimation,  hardware implementation,  VLSI,  

Full Text: PDF(377.8KB)>>
Buy this Article

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 and 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.