Complex Square Root with Operand Prescaling - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Complex Square Root with Operand Prescaling

(1, 2) , (3)
1
2
3

Abstract

We propose a radix-$r$ digit-recurrence algorithm for complex square-root. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This leads to a simple hardware implementation. Moreover, the use of digit recurrence approach allows correct rounding of the result. The algorithm, compatible with the complex division, and its design are described at a high-level. We also give rough comparisons of its latency and cost with respect to implementation based on standard floating-point instructions as used in software routines for complex square root.
Fichier principal
Vignette du fichier
EMAsap04.pdf (333.91 Ko) Télécharger le fichier
Loading...

Dates and versions

ensl-00086852 , version 1 (28-08-2006)

Identifiers

Cite

Jean-Michel Muller, Milos Ercegovac. Complex Square Root with Operand Prescaling. Application-Specific Systems, Architectures and Processors, 2004., Joseph Cavallaro and Lothar Thiele (general chairs), Sep 2004, Galveston, Texas, United States. pp.52-62, ⟨10.1109/ASAP.2004.1342458⟩. ⟨ensl-00086852⟩
100 View
267 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More