DocumentCode :
583065
Title :
Three-Operand Floating-Point Adder
Author :
Tao, Yao ; Deyuan, Gao ; Xiaoya, Fan ; Xianglong, Ren
Author_Institution :
Dept. of Comput. Sci. & Eng., Northwestern Polytech. Univ., Xi´´an, China
fYear :
2012
fDate :
27-29 Oct. 2012
Firstpage :
192
Lastpage :
196
Abstract :
Multi-operand adder is one of attractive solutions compared with a network of 2-operand adders for accelerating algorithms including a lot of addition operations. In this paper, an improved 3-operand floating-point (FP) adder has been presented. Firstly, the internal width of the adder has been given which is compatible with IEEE-Std754. Secondly, a realignment method processing sticky bits is used to make the architecture has the same accuracy with a FP adder which has a infinite internal width. Thirdly, a low cost method to detect catastrophic cancellation has been employed. Several sophisticated techniques, such as compound adder and Leading zero anticipation (LZA), are utilized to optimize the architecture. The implementation results show that the proposed architecture has a competitive area and delay by comparing with both a basic 3-operand FP adder and a network of 2-operand FP adders. A small data format version of the proposed architecture has been verified by an exhaustive testing.
Keywords :
IEEE standards; adders; floating point arithmetic; 3-operand floating-point adder; IEEE-Std754; catastrophic cancellation detection; compound adder; exhaustive testing; leading zero anticipation; multioperand adder; realignment method; Accuracy; Adders; Compounds; Computer architecture; Computers; Delay; Optimization; 3-operand FP adder; catastrophic cancellation; process sticky bits;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology (CIT), 2012 IEEE 12th International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4673-4873-7
Type :
conf
DOI :
10.1109/CIT.2012.58
Filename :
6391897
Link To Document :
بازگشت