A Survey of Some Recent Contributions to Computer Arithmetic
IEEE Transactions on ComputersPublished 1 December 1976
Garner
Citations20
SJR quartileQ1
SJR score1.16
SNIP1.61
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper surveys some recent contributions to computer arithmetic, which includes floating-point arithmetic, nonstandard number systems, and the generation of elementary functions.
Abstract
This paper surveys some recent contributions to computer arithmetic. The survey includes floating-point arithmetic, nonstandard number systems, and the generation of elementary functions. The design objective for these areas is computation that is both accurate and fast.
Keywords
Computer ScienceMathematics
IRE Transactions on Electronic ComputersThe CORDIC Trigonometric Computing Technique
2,586 Citations1959Jack E. Volder
The trigonometric algorithms used in this computer and the instrumentation of these algorithms are discussed in this paper.
A unified algorithm for elementary functions
1,018 Citations1971John Stephen Walther
This paper describes a single unified algorithm for the calculation of elementary functions including multiplication, division, sin, cos, tan, arctan, sinh, cosh, tanh, arCTanh, In, exp and square-root.
Proceedings of the IREHigh-Speed Arithmetic in Binary Computers
616 Citations1961O. L. Macsorley
Methods of obtaining high speed in addition, multiplication, and division in parallel binary computers are described and then compared with each other as to efficiency of operation and cost.
IRE Transactions on Electronic ComputersA New Class of Digital Division Methods
308 Citations1958James E. Robertson
A class of division methods best suited for use in digital computers with facilities for floating point arithmetic by considering the nature of each quotient digit as generated during the division process is described.
IEEE Transactions on ComputersHigher-Radix Division Using Estimates of the Divisor and Partial Remainders
154 Citations1968Daniel E. Atkins
The nature of a class of division techniques which permit the selection of quotient digits in digital division by the inspection of truncated versions of the divisor and partial remainder is reviewed in detail.
DSpace@MIT (Massachusetts Institute of Technology)Applications of division by convergence
142 Citations1964Robert E Goldschmidt
IBM Journal of Research and DevelopmentAutomatic Computation of Exponentials, Logarithms, Ratios and Square Roots
117 Citations1972T. C. Chen
Journal of the ACMOn Local Roundoff Errors in Floating-Point Arithmetic
70 Citations1973Toyohisa Kaneko, Bede Liu
A bound on the relative error in floating-point addition using a single-precision accumulator with guard digits is derived and it is shown that even with a single guard digit, the accuracy can be almost as good as that using a double-preision accumulator.
IBM Journal of Research and DevelopmentPseudo Division and Pseudo Multiplication Processes
55 Citations1962J. E. Meggitt
Some digit-by-digit methods for the evaluation of the elementary functions are described, which involve processes that resemble repeated-addition multiplication and repeated-subtraction division.
IEEE Transactions on ComputersRadix-16 Evaluation of Certain Elementary Functions
52 Citations1973M.D. Ercegovac
This paper describes a family of algorithms for evaluation of a class of elementary functions including division, logarithms, and exponentials and demonstrates the feasibility of higher radix implementations and compares performance with radix 2.
IBM Systems JournalAn analysis of floating-point addition
48 Citations1965Donald W. Sweeney
The frequency of the various shifts for floating-point additions with different radices was derived from the basic data so that designs with various redices may be evaluated.
IEEE Transactions on ComputersRoundings in Floating-Point Arithmetic
47 Citations1973J. M. Yohe
Algorithms for the four binary arithmetic operations and for rounding are presented, together with proofs of their correctness; appropriate formulas for a priori error analysis of these algorithms are presented.
IEEE Transactions on ComputersThe Parallel Evaluation of Arithmetic Expressions Without Division
47 Citations1973Richard P. Brent, David J. Kuck +1 more
As computers become capable of executing more arithmetic operations simultaneously, the question of compiling for such machines becomes more important.
IEEE Transactions on Electronic ComputersRepresentation Error for Real Numbers in Binary Computer Arithmetic
44 Citations1967W. M. McKeeman
The formulas provide quantitative comparison for the effectiveness of alternative formats for real number representations as well as what base is chosen.
IEEE Transactions on ComputersOn the Precision Attainable with Various Floating-Point Number Systems
43 Citations1973Richard P. Brent
SIAM Journal on Numerical AnalysisResidue Arithmetic Algorithms for Exact Computation of<i>g</i>-Inverses of Matrices
40 Citations1976T. M. Rao, K. G. Subramanian +1 more
Three residue arithmetic algorithms are described for exact computation of the Moore–Penrose inverse of a rectangular matrix with rational elements using a partitioning procedure and an orthgonalization procedure.
IEEE Transactions on ComputersMatrix Processors Using p-adic Arithmetic for Exact Linear Computations
39 Citations1977Krishnamurthy Krishnamurthy
The four basic arithmetic algorithms for Hensel's code are described and their application to rational matrix computations is demonstrated by solving a system of linear equations exactly, using the Gaussian elimination procedure.
IEEE Transactions on ComputersStatic and Dynamic Numerical Characteristics of Floating-Point Arithmetic
35 Citations1973William J. Cody
This paper surveys recent events and summarizes the current knowledge of the numerical characteristics of floating-point arithmetic systems and proposes a third numerically attractive alternative for the choice of base.
Communications of the ACMA statistical study of the accuracy of floating point number systems
32 Citations1983H. Kuki, William J. Cody
Tests of the accuracy of certain arithmetic systems in evaluating sums, products and inner products, and analytic error estimates for some of the computations show the usual round mode with guard digits to be statistically superior in accuracy to the usual chop mode in all cases save one.
IEEE Transactions on ComputersA Formalization of Floating-Point Numeric Base Conversion
31 Citations1970David W. Matula
The process of converting arbitrary real numbers into a floating-point format is formalized as a mapping of the reals into a specified subset of real numbers, the set of n significant digit base β floating- point numbers, and properties of conversion mappings are determined.
IEEE Transactions on ComputersA Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics
21 Citations1973J. Marasa, David W. Matula
The accumulated roundoff error incurred in long arithmetic computations involving a randomized mixture of addition, subtraction, multiplication, and division operations applied to an initial randomly generated data base is studied via simulation.
IEEE Transactions on ComputersThe Basis for Implementation of Ad idive Operations in the Residue Number System
20 Citations1968Akio Sasaki
Basic theorems in the algebra are introduced first, and then, based on the theorem, table look-up oriented solutions for hardware overflow checking, sign detection, and floating-point additive operations are given.
IEEE Transactions on ComputersFloating-Point Arithmetic Algorithms in the Symmetric Residue Number System
16 Citations1974Eisuke Kinoshita, Hideo Kosako +1 more
In the symmetric residue system, a new representation of floating-point numbers and arithmetic algorithms for its addition, subtraction, multiplication, and division are proposed.
IEEE Transactions on ComputersComputation Times of Arithmetic and Boolean Functions in (d, r) Circuits
13 Citations1973Philip M. Spira
This paper reviews results previously published on the computation time of d-valued logical circuits for addition and multiplication and for computation of general Boolean functions and explicitly state hitherto unpublished but known results on the time necessary to divide in such circuits.
IEEE Transactions on ComputersMore Efficient Radix-2 Algorithms for Some Elementary Functions
13 Citations1975P.W. Baker
IEEE Transactions on Electronic ComputersA Cellular Threshold Array
11 Citations1967William H. Kautz
The purpose of this paper is to describe the design of an all-digital cellular threshold array that is well adapted to realization by large-scale integrated semiconductor technology.
IEEE Transactions on ComputersMathematical Foundation of Computer Arithmetic
8 Citations1977Kulisch
The papers consider the spaces which occur in numerical computations on computers depending on a properly defined computer arithmetic, and give a summary of the main ideas of these papers.
Matrix processors using p-ADIC arithmetic for exact linear computations
5 Citations1975E. V. Krishnamurtht
A unique code (called Hensel's code) is derived for a rational number, by truncating its infinite padic expansion, and a multiple padic scheme is suggested for the design of a highly parallel matrix processor.
Floating-point computation of functions with maximum accuracy
4 Citations1975Gerd Bohlender
Algorithms are given that compute multiple sums and products and arbitrary roots of floating-point numbers with maximum accuracy and the summation algorithm can be applied to compute scalar products, matrix products, etc.
Consequences of a properly implemented computer arithmetic for periodicities of iterative methods
3 Citations1975Rudi Klatte, Ch. Ullrich
In ordered sets it is possible to show under certain assumptions two basic theorems concerning the cycle length of sequences of iterates generated by monotone operators.
Mathematical foundation of computer arithmetic
2 Citations1975Ulrich Kulisch
During the last years a number of papers concerning a mathematical foundation of computer arithmetic have been written that consider the spaces which occur in numerical computations on computers in dependence of a properly defined computer arithmetic.
Compatible number representations
2 Citations1975Roy A. Keir
A compatible number system for mixed fixed-point and floating-point arithmetic is described in terms of number formats and opcode sequences (for hardwired or microcoded control) to avoid meaningless "normalization" following arithmetic operations.
Deep Blue (University of Michigan)Analysis And Synthesis Of Generalized-radix Additive Normalization Division Techniques.
1 Citations1975V. Ünsal Kalaycioğlu
Programmer-controlled roundoff and the selection of a stable roundoff rule
1 Citations1975Roy A. Keir
The author suggests that every computer with floating-point addition and subtraction should have PSW control able roundoff facilities and Yohe's catalog should be included.