Complex Square Root with Operand Prescaling

Jean-Michel Muller 1, 2 Milos Ercegovac 3
1 LIP - Laboratoire de l'Informatique du Parallélisme
2 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 Digital Arithmetic and Reconfigurable Architecture Laboratory
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.
Keywords : Computer arithmetic complex square-root digit-recurrence algorithm operand prescaling
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00086852
Contributor : Jean-Michel Muller <>
Submitted on : Monday, August 28, 2006 - 10:45:06 AM
Last modification on : Wednesday, November 20, 2019 - 3:23:22 AM
Long-term archiving on: Monday, April 5, 2010 - 10:15:56 PM

File

EMAsap04.pdf

Identifiers

Collections

INRIA | CNRS | LIP | ENS-LYON | UNIV-LYON1 | UDL

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

276

Files downloads

271

Contact

Informations

CCSD