A note on multiple precision arithmetic

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A note on multiple precision arithmetic

Full text

Pdf (98 KB)

Source

Communications of the ACM archive
Volume 4 , Issue 8 (August 1961) table of contents

Page: 353

Year of Publication: 1961

ISSN:0001-0782

Authors

Albert G. Cox	A & M College of Texas, College Station
H. A. Luther	A & M College of Texas, College Station

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 17, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/366678.366693 What is a DOI?

ABSTRACT

Since computers have means to detect overflow on addition or subtraction, this can be used in a multiple precision addition-subtraction subroutine to obviate a sign analysis. Consider all integers in the computer to be expressed “radix t”, that is, in the form a = a0 + a1t + ··· + antn where ai are of like sign and have magnitudes less than t. t is a positive integer determined by the word length of the computer. Consider the expression c = a ± b = (a0 ± b0) + (a1 ± b1)t + ··· + (an ± bn)tn. Here ai ± bi may exceed the storage capacity of one word or may have a sign different from c.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Richard Bellman, Introduction to matrix analysis (2nd ed.), Society for Industrial and Applied Mathematics, Philadelphia, PA, 1997
	2	Leendert De Witte, Least squares fitting of a great circle through points on a sphere, Communications of the ACM, v.3 n.11, p.611-613, Nov. 1960 [doi>10.1145/367436.367478]