The Community for Technology Leaders
Green Image
Issue No. 06 - June (2007 vol. 56)
ISSN: 0018-9340
pp: 727-739
Tom? Lang , IEEE Computer Society
Alberto Nannarelli , IEEE Computer Society
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 recent developments in the theory and practice of this type of algorithm, which were developed for {\rm radix}{\hbox{-}}2^{k} dividers. In addition to the adaptation of these features, the radix-10 quotient digit is decomposed into a radix-2 digit and a radix-5 digit in such a way that only five and two times the divisor are required in the recurrence. Moreover, the most significant slice of the recurrence, which includes the selection function, is implemented in radix-2, avoiding the additional delay introduced by the radix--10 carry-save additions and allowing the balancing of the paths to reduce the cycle delay. The results of the implementation of the proposed radix-10 division unit show that its latency is close to that of radix-16 division units (comparable dynamic range of significands) and it has a shorter latency than a radix-10 unit based on the Newton-Raphson approximation.
Decimal arithmetic, digit-recurrence division, decimal division, algorithms and architectures for floating-point arithmetic.

T. Lang and A. Nannarelli, "A Radix-10 Digit-Recurrence Division Unit: Algorithm and Architecture," in IEEE Transactions on Computers, vol. 56, no. , pp. 727-739, 2007.
90 ms
(Ver 3.3 (11022016))