Complex square root with operand prescaling

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 re...

Full description

Saved in:
Bibliographic Details
Published inProceedings. 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors, 2004 pp. 52 - 62
Main Authors Ercegovac, M.D., Muller, J.-M.
Format Conference Proceeding
LanguageEnglish
Published Los Alamitos CA IEEE 2004
IEEE Computer Society
Subjects
Algorithm design and analysis
Applied sciences
Arithmetic
Computer aided instruction
Computer science
Costs
Delay
Electronics
Exact sciences and technology
Hardware
Integrated circuits
Integrated circuits by function (including memories and processors)
Quantum computing
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Singular value decomposition
Software standards
Recurrence
Floating point
Circuit design
Custom circuit
Delay
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780769522265
0769522262
ISSN:2160-0511
2160-052X
DOI:10.1109/ASAP.2004.1342458