Multi-operand Floating-point Addition

被引:16
作者
Tenca, Alexandre F. [1 ]
机构
[1] Synopsys Inc, Mountain View, CA 94043 USA
来源
ARITH: 2009 19TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER ARITHMETIC | 2009年
关键词
D O I
10.1109/ARITH.2009.27
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The design of a component to perform parallel addition of multiple floating-point (FP) operands is explored in this work. In particular, a 3-input FP adder is discussed in more detail, but the main concepts and ideas presented in this work are valid for FP adders with more inputs. The proposed design is more accurate than conventional FP addition using a network of 2-operand FP adders and it may have competitive area and delay depending on the number of input operands. Implementation results of a 3-operand FP adder are presented to compare its performance to a network of 2-input FP adders.
引用
收藏
页码:161 / 168
页数:8
相关论文
共 7 条
  • [1] Floating-point fused multiply-add: Reduced latency for floating-point addition
    Bruguera, JD
    Lang, T
    [J]. 17TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2005, : 42 - 51
  • [2] Ercegovac M. D., 2003, DIGITAL ARITHMETIC
  • [3] A comparison of three rounding algorithms for IEEE floating-point multiplication
    Even, G
    Seidel, PM
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2000, 49 (07) : 638 - 650
  • [4] GOLDBERG D, 1991, ACM COMPUTING SU MAR
  • [5] IEEE Computer Society, 1985, 7541985 IEEE
  • [6] Optimistic parallelization of floating-point accumulation
    Kapre, Nachiket
    Dehon, Andre
    [J]. 18TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2007, : 205 - +
  • [7] Parhami Behrooz, 2010, Computer Arithmetic Algorithms and Hardware Designs