Complex Square Root with Operand Prescaling

Milos Ercegovac 1 Jean-Michel Muller 1
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Document type :
Reports
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070681
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:11:55 PM
Last modification on : Tuesday, April 30, 2019 - 3:46:41 PM

Identifiers

  • HAL Id : inria-00070681, version 1

Collections

Citation

Milos Ercegovac, Jean-Michel Muller. Complex Square Root with Operand Prescaling. [Research Report] RR-5319, LIP RR-2004-42, INRIA, LIP. 2004, pp.18. ⟨inria-00070681⟩

Share

Metrics

Record views

181

Files downloads

265