DocumentCode
3195147
Title
On the design of fast IEEE floating-point adders
Author
Seidel, Peter-Michael ; Even, Guy
Author_Institution
Dept. of Comput. Sci. & Eng., Southern Methodist Univ., Dallas, TX, USA
fYear
2001
fDate
2001
Firstpage
184
Lastpage
194
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 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
Keywords
adders; circuit optimisation; floating point arithmetic; logic design; IEEE rounding modes; IEEE standard; addition; approximate counting; borrow-save representation; clock periods; complement subtraction; compound adders; double precision; fast IEEE floating-point adder design; fast circuits; latches; latency; leading zeros; logic levels; normalized numbers; normalized rounded sum/difference; optimization techniques; rounding algorithm; sign-magnitude computation; subtraction; Adders; Algorithm design and analysis; Circuits; Clocks; Delay; Design optimization; Latches; Logic design; Partitioning algorithms; Pipelines;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic, 2001. Proceedings. 15th IEEE Symposium on
Conference_Location
Vail, CO
ISSN
1063-6889
Print_ISBN
0-7695-1150-3
Type
conf
DOI
10.1109/ARITH.2001.930118
Filename
930118
Link To Document