This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Constant Division Routines
September 1985 (vol. 34 no. 9)
pp. 866-869
null S.-Y.R. Li, Bell Communications Research
When there is no division circuit available, the arithmetical function of division is normally performed by a library subroutine. The library subroutine normally allows both the divisor and the dividend to be variables, and requires the execution of hundreds of assembly instructions. This correspondence provides a fast algorithm for performing the integer division of a variable by a predetermined divisor. Based upon this algorithm, an efficient division routine has been constructed for each odd divisor up to 55. These routines may be implemented in assembly languages, in microcodes, and in special-purpose circuits.
Index Terms:
Fermat's Little Theorem, Constant division, fast division
Citation:
null S.-Y.R. Li, "Fast Constant Division Routines," IEEE Transactions on Computers, vol. 34, no. 9, pp. 866-869, Sept. 1985, doi:10.1109/TC.1985.1676646
Usage of this product signifies your acceptance of the Terms of Use.