Complex Square Root with Operand Prescaling

  • Authors:

  • Milos D. Ercegovac;Jean-Michel Muller

  • Affiliations:

  • University of California at Los Angeles;Ecole Normale Supérieure de Lyon, France

  • Venue:
  • ASAP '04 Proceedings of the Application-Specific Systems, Architectures and Processors, 15th IEEE International Conference
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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 toa simple hard-ware 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.