HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Complex Square Root with Operand Prescaling

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 :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

Contributor : Jean-Michel Muller Connect in order to contact the contributor
Submitted on : Monday, August 28, 2006 - 10:45:06 AM
Last modification on : Friday, February 4, 2022 - 3:11:42 AM
Long-term archiving on: : Monday, April 5, 2010 - 10:15:56 PM




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⟩



Record views


Files downloads