Complex Square Root with Operand Prescaling

Jean-Michel Muller; Milos Ercegovac

Complex Square Root with Operand Prescaling

Jean-Michel Muller ^{1, 2} Milos Ercegovac ³

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

Domain :

Computer Science [cs] / Other [cs.OH]

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, August 7, 2019 - 12:14:40 PM
Long-term archiving on : Monday, April 5, 2010 - 10:15:56 PM

Complex Square Root with Operand Prescaling

File

Identifiers

Collections

Citation

Export

Metrics

254

197

Contact

Complex Square Root with Operand Prescaling

File

Identifiers

Collections

Citation

Export

Share

Metrics

254

197

Contact