首页> 外文学位 >Algorithms and Architectures for Decimal Transcendental Function Computation.
【24h】

Algorithms and Architectures for Decimal Transcendental Function Computation.

机译:十进制先验函数计算的算法和体系结构。

获取原文
获取原文并翻译 | 示例

摘要

Nowadays, there are many commercial demands for decimal floating-point (DFP) arithmetic operations such as financial analysis, tax calculation, currency conversion, Internet based applications, and e-commerce. This trend gives rise to further development on DFP arithmetic units which can perform accurate computations with exact decimal operands. Due to the significance of DFP arithmetic, the IEEE 754-2008 standard for floating-point arithmetic includes it in its specifications. The basic decimal arithmetic unit, such as decimal adder, subtracter, multiplier, divider or square-root unit, as a main part of a decimal microprocessor, is attracting more and more researchers' attentions. Recently, the decimal-encoded formats and DFP arithmetic units have been implemented in IBM's system z900, POWER6, and z10 microprocessors.;In this dissertation, we researched and developed several new decimal algorithms and architectures for the DFP transcendental function computation. These designs are composed of several different methods: 1) the decimal transcendental function computation based on the table-based first-order polynomial approximation method; 2) DFP logarithmic and antilogarithmic converters based on the decimal digit-recurrence algorithm with selection by rounding; 3) a decimal reciprocal unit using the efficient table look-up based on Newton-Raphson iterations; and 4) a first radix-100 division unit based on the non-restoring algorithm with pre-scaling method. Most decimal algorithms and architectures for the DFP transcendental function computation developed in this dissertation have been the first attempt to analyze and implement the DFP transcendental arithmetic in order to achieve faithful results of DFP operands, specified in IEEE 754-2008.;To help researchers evaluate the hardware performance of DFP transcendental arithmetic units, the proposed architectures based on the different methods are modeled, verified and synthesized using FPGAs or with CMOS standard cells libraries in ASIC. Some of implementation results are compared with those of the binary radix-16 logarithmic and exponential converters; recent developed high performance decimal CORDIC based architecture; and Intel's DFP transcendental function computation software library. The comparison results show that the proposed architectures have significant speed-up in contrast to the above designs in terms of the latency. The algorithms and architectures developed in this dissertation provide a useful starting point for future hardware-oriented DFP transcendental function computation researches.;Increasing chip densities and transistor count provide more room for designers to add more essential functions on application domains into upcoming microprocessors. Decimal transcendental functions, such as DFP logarithm, antilogarithm, exponential, reciprocal and trigonometric, etc, as useful arithmetic operations in many areas of science and engineering, has been specified as the recommended arithmetic in the IEEE 754-2008 standard. Thus, virtually all the computing systems that are compliant with the IEEE 754-2008 standard could include a DFP mathematical library providing transcendental function computation. Based on the development of basic decimal arithmetic units, more complex DFP transcendental arithmetic will be the next building blocks in microprocessors.
机译:如今,对十进制浮点(DFP)算术运算有许多商业需求,例如财务分析,税金计算,货币换算,基于Internet的应用程序和电子商务。这种趋势引起了DFP算术单元的进一步发展,该算术单元可以使用精确的十进制操作数执行精确的计算。由于DFP算术的重要性,IEEE 754-2008浮点算术标准将其包含在其规范中。基本的十进制算术单元,例如十进制加法器,减法器,乘法器,除法器或平方根单元,作为十进制微处理器的主要组成部分,正吸引着越来越多的研究人员的注意力。最近,十进制编码格式和DFP算术单元已在IBM的系统z900,POWER6和z10微处理器中实现。本文,我们研究和开发了几种用于DFP先验函数计算的新十进制算法和体系结构。这些设计由几种不同的方法组成:1)基于基于表的一阶多项式逼近方法的十进制超越函数计算; 2)基于十进制数递归算法的DFP对数和反对数转换器,并通过舍入进行选择; 3)使用基于牛顿-拉夫森迭代的有效表查找的十进制倒数单位; 4)第一基数为100的除法单元,其基于具有预缩放方法的非恢复算法。本论文开发的大多数用于DFP超越函数计算的十进制算法和体系结构都是首次尝试分析和实现DFP超越算法,以实现DFP操作数的真实结果(IEEE 754-2008中指定)。由于DFP超越运算单元的硬件性能,使用FPGA或ASIC中的CMOS标准单元库对基于不同方法的建议架构进行了建模,验证和综合。将一些实现结果与二进制基数16对数和指数转换器的实现结果进行了比较;最近开发的基于高性能十进制CORDIC的架构;和英特尔的DFP先验功能计算软件库。比较结果表明,与上述设计相比,所提出的体系结构在等待时间方面具有显着的提速。本文开发的算法和体系结构为未来面向硬件的DFP先验函数计算研究提供了有用的起点。增加芯片密度和晶体管数量为设计人员提供了更多的空间,可为应用程序在即将到来的微处理器中添加更多基本功能。在科学和工程学的许多领域中,十进制先验函数(例如DFP对数,反对数,指数,倒数和三角函数等)作为有用的算术运算已被指定为IEEE 754-2008标准中的推荐算术。因此,实际上,所有符合IEEE 754-2008标准的计算系统都可以包括提供超越函数计算的DFP数学库。基于基本十进制算术单元的发展,更复杂的DFP先验算法将成为微处理器的下一个构建块。

著录项

  • 作者

    Chen, Dongdong.;

  • 作者单位

    The University of Saskatchewan (Canada).;

  • 授予单位 The University of Saskatchewan (Canada).;
  • 学科 Engineering Electronics and Electrical.;Computer Science.
  • 学位 Ph.D.
  • 年度 2011
  • 页码 196 p.
  • 总页数 196
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号