Exact accumulation of floating-point numbers

The authors present a new idea for designing a chip which computes the exact sum of arbitrarily many floating-point numbers, i.e. it can accumulate the floating-point numbers without cancellation. Such a chip is needed to provide a fast implementation of Kulisch arithmetic. This is a new theory of floating-point arithmetic which makes it possible to compute least significant bit accurate solutions to even ill-conditioned numerical problems. The proposed approach avoids the disadvantages of previously suggested designs which are too large, too slow, or consume too much power. The crucial point is a technique for a fast carry resolution in a long accumulator. It can also be implemented in software. >

[1]  Peter R. Cappello,et al.  Systolic Super Summation , 1988, IEEE Trans. Computers.

[2]  Willard L. Miranker,et al.  A new approach to scientific computation , 1983 .

[3]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[4]  Bernd Becker,et al.  On the Construction of Optimal Time Adders (Extended Abstract) , 1988, STACS.

[5]  Louis B. Rall,et al.  Pascal-SC: A computer language for scientific computation , 1987 .

[6]  Willard L. Miranker,et al.  Computer arithmetic in theory and practice , 1981, Computer science and applied mathematics.

[7]  Ulrich W. Kulisch,et al.  Accurate Arithmetic for Vector Processors , 1988, J. Parallel Distributed Comput..

[8]  Christian P. Ullrich,et al.  Computer Arithmetic and Self-Validating Numerical Methods , 1990, Notes and reports in mathematics in science and engineering.

[9]  Michael L. Fredman,et al.  BLASTING through the information theoretic barrier with FUSION TREES , 1990, STOC '90.

[10]  Bernd Becker Efficient Testing of Optimal Time Adders , 1988, IEEE Trans. Computers.

[11]  Jack Sklansky,et al.  Conditional-Sum Addition Logic , 1960, IRE Trans. Electron. Comput..