By Topic

On the Complexity of Table Lookup for Iterative Division

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Parhami, B. ; School of Computer Science, Carleton University

We show that except for a few special cases allowing smaller tables, the lookup table used for achieving k digits of convergence after the initial multiplication (or for obtaining the approximate reciprocal of the divisor with k − 1 digits of accuracy) in iterative division methods must have at least (r−-l) rk words of k + I digits, r being the number representation base. In the important special case of r = 2 with k ≥5, a 2k-word table with k-bit entries can be used, since the initial digit is always 1. It is also shown that a table of this optimal size can always be constructed. The special cases corresponding to r = 3 with k = 1, and r = 2 with k ≤ 4, allow smaller tables than the general case and are thus handled separately.

Published in:

Computers, IEEE Transactions on  (Volume:C-36 ,  Issue: 10 )