Boosting Very-High Radix Division with Prescaling and Selection by Rounding

An extension of the very-high radix division with prescaling and selection by rounding is presented. This extension consists in increasing the effective radix of the implementation by obtaining a few additional bits of the quotient per iteration, without increasing the complexity of the unit to obtain the prescaling factor nor the delay of an iteration. As a consequence, for some values of the effective radix, it permits an implementation with a smaller area and the same execution time than the original scheme. Estimations are given for 54-bit and 114-bit quotients.

• Type: Conference
• Year: 1999
• Where: ARITH
• Authors: Paolo Montuschi, Tomás Lang
• Keywords: Additional Bits, Applied Computing, ARITH 1999, Effective Radix, Prescaling Factor