A division algorithm in which the quotient-digit selection is performed by rounding the shifted residual in carry-save form is presented. To allow the use of this simple function, the divisor (and dividend) is prescaled to a range close to one. The implementation presented results in a fast iteration because of the use of carry-save forms and suitable recodings. The execution time is calculated, and several convenient values of the radix are selected. Comparison with other high-radix dividers is performed using the same assumptions
Very High Radix Division with Selection by Rounding and Prescaling / Ercegovac, M.; Lang, T.; Montuschi, Paolo. - STAMPA. - (1993), pp. 112-119. (Intervento presentato al convegno IEEE 11th Symposium on Computer Arithmetic tenutosi a Windsor (ON), Canada nel July 1993) [10.1109/ARITH.1993.378102].
Very High Radix Division with Selection by Rounding and Prescaling
MONTUSCHI, PAOLO
1993
Abstract
A division algorithm in which the quotient-digit selection is performed by rounding the shifted residual in carry-save form is presented. To allow the use of this simple function, the divisor (and dividend) is prescaled to a range close to one. The implementation presented results in a fast iteration because of the use of carry-save forms and suitable recodings. The execution time is calculated, and several convenient values of the radix are selected. Comparison with other high-radix dividers is performed using the same assumptionsPubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2500971
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo