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

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Paolo Montuschi Articles by Tomas Lang

14th IEEE Symposium on Computer Arithmetic (ARITH-14 '99)

Adelaide, Australia

April 14-April 16

ISBN: 0-7695-0116-8

	ASCII Text	x
	Paolo Montuschi, Tomas Lang, "Boosting Very-High Radix Division with Prescaling and Selection by Rounding," Computer Arithmetic, IEEE Symposium on, pp. 52, 14th IEEE Symposium on Computer Arithmetic (ARITH-14 '99), 1999.

	BibTex	x
	@article{ 10.1109/ARITH.1999.762828, author = {Paolo Montuschi and Tomas Lang}, title = {Boosting Very-High Radix Division with Prescaling and Selection by Rounding}, journal ={Computer Arithmetic, IEEE Symposium on}, volume = {0}, year = {1999}, issn = {1063-6889}, pages = {52}, doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.1999.762828}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Arithmetic, IEEE Symposium on TI - Boosting Very-High Radix Division with Prescaling and Selection by Rounding SN - 1063-6889 SP EP A1 - Paolo Montuschi, A1 - Tomas Lang, PY - 1999 VL - 0 JA - Computer Arithmetic, IEEE Symposium on ER -

Paolo Montuschi, Politecnico di Torino

Tomas Lang, University of California at Irvine

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1999.762828

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.

Citation:

Paolo Montuschi, Tomas Lang, "Boosting Very-High Radix Division with Prescaling and Selection by Rounding," arith, pp.52, 14th IEEE Symposium on Computer Arithmetic (ARITH-14 '99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.