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.
Boosting Very High Radix Division with Prescaling and Selection by Rounding / Montuschi P.; Lang T.. - STAMPA. - (1999), pp. 52-59. ((Intervento presentato al convegno IEEE 14th Symposium on Computer Arithmetic tenutosi a Adelaide, Australia nel April 1999 [10.1109/ARITH.1999.762828].
Titolo: | Boosting Very High Radix Division with Prescaling and Selection by Rounding | |
Autori: | ||
Data di pubblicazione: | 1999 | |
Abstract: | An extension of the very-high radix division with prescaling and selection by rounding is present...ed. 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. | |
ISBN: | 0769501168 | |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
http://hdl.handle.net/11583/2500960