Complex Square Root with Operand Prescaling |
| |
| Authors: | Milo&# D. Ercegovac Jean-Michel Muller |
| |
| Affiliation: | (1) Computer Science Department, University of California at Los Angeles, 4732 Boelter Hall, Los Angeles, CA 90095, USA;(2) CNRS-Laboratoire CNRS-ENSL-INRIA-UCBL LIP Ecole Normale Supérieure de Lyon, 46 Allée d’Italie, 69364 Lyon Cedex 07, France |
| |
| 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 of digit selection. Moreover, the use of digit recurrence approach allows correct rounding of the result if needed. The algorithm, compatible with the complex division presented in Ercegovac and Muller (“Complex Division with Prescaling of the Operands,” in Proc. Application-Specific Systems, Architectures, and Processors (ASAP’03), The Hague, The Netherlands, June 24–26, 2003), and its design are described. We also give rough estimates 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 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
