Thumbnail
Access Restriction
Subscribed

Author Ehrman, John R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Maximum significance arithmetic ♦ Full-precision arithmetic ♦ Binary arithmetric ♦ Unsigned operand arithmetic
Abstract In reference [1] algorithms for performing arithmetic with unsigned two's complement operands were described. The scheme for division was implemented in a set of multiple-precision floating-point arithmetic routines [2]. User experience with those routines showed that there is one case where the algorithm fails [3]. We give here a modification to the algorithm which eliminates the error condition. Equations are numbered beginning with (20), so that we may refer to equations in the original paper as well.
Description Affiliation: Stanford Linear Accelerator Center, Stanford, CA (Ehrman, John R.)
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 13
Issue Number 11
Page Count 2
Starting Page 697
Ending Page 698


Open content in new tab

   Open content in new tab
Source: ACM Digital Library