On the Design of the Arithmetic Unit of a Fixed-Word-Length Computer from the Standpoint of Computational Accuracy

It is proposed that possibly the best criterion for judging the arithmetic unit of any modern high-speed computer is its ability to compute d=(a 1 b 1 + a 2 b 2 + ... +a n b n )/ c ``accurately'' in the sense of J. H. Wilkinson. Here d, c, and a i , b i for i = 1, 2, ... , n, are assumed to be single-length numbers. However, the ability to retain each product a i b i double-length is desirable for high accuracy. For example, in fixed-point arithmetic d can be computed subject to only one rounding error in computers which possess a double-length accumulator that has the ability to sum the double-length products a i b i and to divide the double-length dividend (a 1 b 1 +a 2 b 2 + ... +a n b n ) by the single-length divisor c, yielding a properly rounded quotient d. (Equally good results can be achieved in floating-point.) Several numerical examples are given which show the remarkable improvement in the accuracy of computed results in machines which pass this test. The need for a long-word-length is stressed, along with the need for both rounded and unrounded fixed-point and floating-point arithmetic.