Open AccessDecimal floating‐point fused multiply‐add with redundant internal encodings
Author(s) -
Han Liu,
Zhang Hao,
Ko SeokBum
Publication year - 2016
Publication title -
iet computers and digital techniques
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.219
H-Index - 46
ISSN - 1751-861X
DOI - 10.1049/iet-cdt.2015.0058
Subject(s) - rounding , adder , arithmetic , decimal , critical path method , computer science , floating point , square root , binary number , division (mathematics) , parallel computing , multiplier (economics) , multiplication algorithm , algorithm , mathematics , engineering , latency (audio) , telecommunications , geometry , systems engineering , economics , macroeconomics , operating system
Decimal floating‐point (DFP) arithmetic has attracted attention in the applications of financial and commercial computing. However, the processing efficiency of DFP is still far away from that of binary designs. On the other hand, a floating‐point fused multiply‐add (FMA) function is widely used in many processors within functional iterations to implement division, square root, and many other functions due to the better accuracy achieved by a single rounding of continuous multiplication and addition. In this work, a new architecture of FMA is proposed to speed up the DFP processing. Compared with previous architectures, first, the proposed design applies a specific decimal redundant encoding system. The circuits to decide and shift the rounding position on a redundant result are therefore simplified. Second, the only digit‐set conversion in the entire design is combined with the rounding operation to further reduce the critical path. Third, the techniques applied in different previous FMAs are merged in the proposed design. In addition the multiplier and adder referred to the previous designs are further optimised. Consequently, compared with the fastest previous design, the synthesis results show about 33.7% speed advantage and about 16.6% area advantage.