Thumbnail
Access Restriction
Subscribed

Author Mifsud, Charles J. ♦ Bohlen, Michael J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Multiple-precision ♦ Division ♦ Overflow
Abstract In [1] Mifsud presented a generalized division algorithm for positive integral operands. The uniqueness of the method was advertised as causing each trial cipher in the quotient to be either equal to or one greater than its final replacement. The method of describing the algorithm was intended to stress the simple mathematical facts that were the basis of the algorithm. However, some difficulty arises with the programming and implementation of the algorithm. Article [1] addressed itself to the calculation of the trial cipher by using the first two digits of the partial dividend (step 6); i.e. it formed [pr+1pr/dr], with pr+1 < dr, where the bracket is used to indicate the integral part of its content. Thus the paper conveniently avoided the possibility of overflow which would happen if pr+1 = dr.
Description Affiliation: The Mitre Corp., McLean, VA (Mifsud, Charles J.; Bohlen, Michael J.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 10


Open content in new tab

   Open content in new tab
Source: ACM Digital Library