DocumentCode :
1111161
Title :
A Note on Division Algorithms Based on Multiplication
Author :
Shaham, Z. ; Riesel, Z.
Author_Institution :
Faculty of Electrical Engineering, Technion, Israel Institute of Technology
Issue :
5
fYear :
1972
fDate :
5/1/1972 12:00:00 AM
Firstpage :
513
Lastpage :
514
Abstract :
The algorithm of division based on multiplication is well known [1]-[5]. It permits utilization of fast multiply hardware in the implementation of division. The algorithm defines an iterative process in which numerator and denominator are both multiplied by the same factor misuch that the denominator converges to 1 and the numerator to the quotient. Convergence can be speeded up by finding a good value for m0, the first multiplier, by means of table lookup. The first two bits of the denominator D are 0.1 (assuming a normalized denominator). The next n bits are used to enter the table, yielding m0and D1=m0*D, where D1has a bits of convergence and as shown in [6].
Keywords :
Assembly; Convergence; Eigenvalues and eigenfunctions; Equations; Hardware; Iterative algorithms; Mathematics; Table lookup; Testing;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1972.223557
Filename :
1672150
Link To Document :
بازگشت