Pseudorandom Rounding for Truncated Multipliers

Authors:
N. Yoshida;E. Goto;S. Ichikawa
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
1991

Citing 4
Cited 1

On roundoff error distributions in floating point and logarithmic arithmetic

Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Improved Trailing Digits Estimates Applied to Optimal Computer Arithmetic

Journal of the ACM (JACM)
Probabilistic error analysis of floating point and crd arithmetics

Probabilistic error analysis of floating point and crd arithmetics

A low error and high performance multiplexer-based truncated multiplier

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

An economical, unbiased, overflow-free rounding scheme for multiplication of multiple-precision floating-point numbers is proposed. The scheme, called pseudorandom rounding, saves multiplications of lower bits and makes use of statistical properties of bits around the least significant bit of products in order to compensate for truncated parts. The method is deterministic, and inputs are commutable. The validity of the rounding is verified by numerical simulation.