Fast Decimal Floating-Point Division

A new implementation for decimal floating-point (DFP) division is introduced. The algorithm is based on high-radix SRT division<footnoteref refid="fn1" role="fn"/><footnote id="fn1" role="fn"><footnotepara role="fn">The SRT division algorithm is named after D. Sweeney [46], J. E. Robertson [47], and T. D. Tocher [48].</footnotepara></footnote> with the recurrence in a new decimal signed-digit format. Quotient digits are selected using comparison multiples, where the magnitude of the quotient digit is calculated by comparing the truncated partial remainder with limited precision multiples of the divisor. The sign is determined concurrently by investigating the polarity of the truncated partial remainder. A timing evaluation using a logic synthesis shows a significant decrease in the division execution time in contrast with one of the fastest DFP dividers reported in the open literature.