A Minimum Table Size Result for Higher Radix Nonrestoring Division

L.B. Bushard

doi:10.1109/TC.1983.1676273

Publication
1983
Issue No. 6 - June
Abstract - A Minimum Table Size Result for Higher Radix Nonrestoring Division

	This Article
	PDF 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 L.B. Bushard

A Minimum Table Size Result for Higher Radix Nonrestoring Division (PDF)

June 1983 (vol. 32 no. 6)

pp. 521-526

	ASCII Text	x
	L.B. Bushard, "A Minimum Table Size Result for Higher Radix Nonrestoring Division," IEEE Transactions on Computers, vol. 32, no. 6, pp. 521-526, June, 1983.

	BibTex	x
	@article{ 10.1109/TC.1983.1676273, author = {L.B. Bushard}, title = {A Minimum Table Size Result for Higher Radix Nonrestoring Division}, journal ={IEEE Transactions on Computers}, volume = {32}, number = {6}, issn = {0018-9340}, year = {1983}, pages = {521-526}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676273}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - A Minimum Table Size Result for Higher Radix Nonrestoring Division IS - 6 SN - 0018-9340 SP521 EP526 EPD - 521-526 A1 - L.B. Bushard, PY - 1983 KW - radix 2 KW - Digital arithmetic KW - digital division KW - inequalities KW - logic design KW - minimum table size KW - n-bit fraction KW - nonrestoring division KW - normalized VL - 32 JA - IEEE Transactions on Computers ER -

L.B. Bushard, Sperry Univac

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1983.1676273

The minimum table size is established for nonrestoring division algorithms that utilize a table lookup technique for quotient digit selection. It is assumed that the dividend and divisor are n-bit fractions, that the algorithm is radix 2^q, q = 2, and that the algorithm uses the table on an iteration in which any remainder in the range 0 to 1/2 ? 1/2ⁿ⁺¹can occur as, for exampl

Index Terms:

radix 2, Digital arithmetic, digital division, inequalities, logic design, minimum table size, n-bit fraction, nonrestoring division, normalized

Citation:

L.B. Bushard, "A Minimum Table Size Result for Higher Radix Nonrestoring Division," IEEE Transactions on Computers, vol. 32, no. 6, pp. 521-526, June 1983, doi:10.1109/TC.1983.1676273

Peer Review Notice | Give Us Feedback

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