【24h】

Decimal Floating-Point Square Root Using Newton-Raphson Iteration

机译:小数浮点平方根使用牛顿列尾迭代

获取原文

摘要

With continued reductions in feature size, additional functionality may be added to future microprocessors to boost the performance of important application domains. Due to growth in commercial, financial, and Internet-based applications, decimal floating point arithmetic is now attracting more attention and hardware support for decimal operations is being considered by various computer manufacturers. In order to standardize decimal number formats and operations, specifications for decimal floating-point arithmetic have been added to the draft revision of the IEEE-754 Standard for Floating-Point Arithmetic (IEEE-754R). This paper presents an efficient arithmetic algorithm and hardware design for decimal floating-point square root. This design uses an optimized piecewise linear approximation, a modified Newton-Raphson iteration, a specialized rounding technique, and a modified decimal multiplier. Synthesis results show that a 64-bit (16-digit) implementation of decimal square root, which is compliant with IEEE-754R, has an estimated critical path delay of 0.95 ns and a maximum latency of 210 clock cycles when implemented using a sequential multiplier and LSI Logic's 0.11 micron Gflx-P standard cell library.
机译:通过在特征大小的持续缩短中,可以添加其他功能到未来的微处理器,以提高重要应用域的性能。由于商业,金融和基于互联网的应用程序的增长,小数浮点算术现在吸引了更多的关注,并且各种计算机制造商都考虑了对十进制操作的硬件支持。为了标准化十进制数格式和操作,已经将十进制浮点算术的规范添加到浮点算术(IEEE-754R)的IEEE-754标准的修订草稿中。本文提出了一种高效的算术算法和十进制浮点方形根的硬件设计。该设计采用优化的分段线性近似,改进的牛顿 - 拉赛迭代,专业的舍入技术和改进的十进制乘法器。合成结果表明,当使用顺序乘数实施时,符合IEEE-754R的十进制平方根,符合IEEE-754R的小数方根的实现具有0.95 ns的估计临界路径延迟,以及210个时钟周期的最大延迟和LSI逻辑的0.11微米GFLX-P标准单元库。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号