ACM

Communications of the ACM

Home/Magazine Archive/November 1970 (Vol. 13, No. 11)/Correction to “logical” arithmetric on computers with.../Abstract

Correction to “logical” arithmetric on computers with two's complement binary arithmetic

By John R. Ehrman
Communications of the ACM, November 1970, Vol. 13 No. 11, Pages 697-698
10.1145/362790.362809
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.