Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

A note on multiple precision arithmetic

Published: 01 August 1961 Publication History

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

[1]
1. BELLMAN, RICHARD. Introduction to Matrix Analysis, Ch. 4. McGraw-Hill Book Co., New York, (1960).
[2]
2. DE WITTE, LEENDERT. Least squares fitting of a great circle through points on a sphere. Comm. ACM 3, (Oct. 1960), 611-613.

Cited By

View all
  • (2023)Design Space Exploration of Galois and Fibonacci Configuration Based on Espresso Stream CipherACM Transactions on Reconfigurable Technology and Systems10.1145/356742816:3(1-24)Online publication date: 20-Jun-2023
  • (2023)Adaptive Selection and Clustering of Partial Reconfiguration Modules for Modern FPGA Design FlowACM Transactions on Reconfigurable Technology and Systems10.1145/356742716:2(1-24)Online publication date: 2-Apr-2023
  • (2023)Automatic Creation of High-bandwidth Memory Architectures from Domain-specific Languages: The Case of Computational Fluid DynamicsACM Transactions on Reconfigurable Technology and Systems10.1145/356355316:2(1-34)Online publication date: 11-Mar-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1961
Published in CACM Volume 4, Issue 8

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)49
  • Downloads (Last 6 weeks)11
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Design Space Exploration of Galois and Fibonacci Configuration Based on Espresso Stream CipherACM Transactions on Reconfigurable Technology and Systems10.1145/356742816:3(1-24)Online publication date: 20-Jun-2023
  • (2023)Adaptive Selection and Clustering of Partial Reconfiguration Modules for Modern FPGA Design FlowACM Transactions on Reconfigurable Technology and Systems10.1145/356742716:2(1-24)Online publication date: 2-Apr-2023
  • (2023)Automatic Creation of High-bandwidth Memory Architectures from Domain-specific Languages: The Case of Computational Fluid DynamicsACM Transactions on Reconfigurable Technology and Systems10.1145/356355316:2(1-34)Online publication date: 11-Mar-2023
  • (2023)Hardware-accelerated Real-time Drift-awareness for Robust Deep Learning on Wireless RF DataACM Transactions on Reconfigurable Technology and Systems10.1145/356339416:2(1-29)Online publication date: 11-Mar-2023
  • (2023)A Survey on FPGA Cybersecurity Design StrategiesACM Transactions on Reconfigurable Technology and Systems10.1145/356151516:2(1-33)Online publication date: 11-Mar-2023
  • (2023)FPGA Acceleration of Probabilistic Sentential Decision Diagrams with High-level SynthesisACM Transactions on Reconfigurable Technology and Systems10.1145/356151416:2(1-22)Online publication date: 11-Mar-2023
  • (2022)Nearly Optimal Pseudorandomness from HardnessJournal of the ACM10.1145/355530769:6(1-55)Online publication date: 17-Nov-2022
  • (1977)Lucid, a nonprocedural language with iterationCommunications of the ACM10.1145/359636.35971520:7(519-526)Online publication date: 1-Jul-1977
  • (1973)Synchronizing processors with memory-content-generated interruptsCommunications of the ACM10.1145/362248.36464116:6(350-351)Online publication date: 1-Jun-1973
  • (1973)Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM10.1145/362248.36227216:6(372-378)Online publication date: 1-Jun-1973
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media