首页> 外文会议> >On the design of fast IEEE floating-point adders
【24h】

On the design of fast IEEE floating-point adders

机译:关于快速IEEE浮点加法器的设计

获取原文

摘要

We present an IEEE floating-point adder (FP-adder) design. The adder accepts normalized numbers, supports all four IEEE rounding modes, and outputs the correctly normalized rounded sum/difference in the format required by the IEEE standard. The latency of the design for double precision is roughly 24 logic levels, not including delays of latches between pipeline stages. Moreover, the design can be easily partitioned into 2 stages consisting of 12 logic levels each, and hence, can be used with clock periods that allow for 12 logic levels between latches. The FP-adder design achieves low latency by combining various optimization techniques such as: a non-standard separation into two paths, a simple rounding algorithm, unifying rounding cases for addition and subtraction, sign-magnitude computation of a difference based on complement subtraction, compound adders, and fast circuits for approximate counting of leading zeros from borrow-save representation. A comparison of our design with other implementations suggests a reduction in the latency by at least two logic levels as well as simplified rounding implementation. A reduced precision version of our algorithm has been verified by exhaustive testing.
机译:我们提出一种IEEE浮点加法器(FP-adder)设计。加法器接受归一化的数字,支持所有四个IEEE舍入模式,并以IEEE标准要求的格式输出正确归一化的舍入和/差。双精度设计的等待时间约为24个逻辑级别,不包括流水线级之间的锁存器延迟。此外,该设计可以容易地划分为两个阶段,每个阶段包括12个逻辑电平,因此可以与允许在锁存器之间使用12个逻辑电平的时钟周期一起使用。 FP加法器设计通过组合各种优化技术来实现低延迟,这些优化技术包括:将非标准路径分为两条路径,简单的舍入算法,统一用于加法和减法的舍入情况,基于补码减法的差的符号幅度计算,复合加法器和快速电路,用于从借位保存表示形式中对前导零进行近似计数。通过将我们的设计与其他实现进行比较,可以将等待时间至少减少两个逻辑级别,并简化了舍入实现。我们的算法的降低精度版本已经通过详尽的测试进行了验证。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号