loading...
On the Design of Fast IEEE Floating-Point Adders
Vail, Colorado June 11-June 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2001.93011815th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Peter-Michael Seidel, Southern Methodist University
Guy Even, Tel-Aviv University
Abstract: 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 a 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 one's complement sub-traction, 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.
Citation:
Peter-Michael Seidel, Guy Even, "On the Design of Fast IEEE Floating-Point Adders," arith, pp.0184, 15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.