Abstract: Decimal floating point operations are important for applications that cannot tolerate errors from conversions between binary and decimal formats, ...
• a fast constant digit selection function, i.e., the selection constants do not depend on the divisor's value. • carry-save representation of the residual.
In this work we present a radix-10 digit recurrence division algorithm that decomposes the quotient digits into three parts and requires only the computation of ...
This work presents a radix-10 digit recurrence division algorithm that decomposes the quotient digits into three parts and requires only the computation of ...
In this work we present a radix-10 digit recurrence division algorithm that decomposes the quotient digits into three parts and requires only the computation of ...
[PDF] A Radix-10 Digit-Recurrence Division Unit: Algorithm and Architecture
www2.imm.dtu.dk › imm5282
Abstract—In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm. The previous decimal division designs do not ...
The most significant slice of the recurrence, which includes the selection function, is implemented in radix-2, avoiding the additional delay introduced by ...
In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm. The previous decimal division designs do not include ...
Missing: constant | Show results with:constant
The corresponding structure of the operation is shown in Fig. 1. We now concentrate on the digit-recurrence algorithm to obtain the significand of the quotient.
In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm. The previous decimal division designs do not include ...