Complex square root with operand prescaling

被引:3
|
作者
Ercegovac, MD [1 ]
Muller, JM [1 ]
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
来源
15TH IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES AND PROCESSORS, PROCEEDINGS | 2004年
关键词
D O I
10.1109/ASAP.2004.1342458
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a radix-r digit-recurrence algorithm for complex square-root ne 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.
引用
收藏
页码:52 / 62
页数:11
相关论文
共 50 条