DocumentCode
1323591
Title
Pseudorandom rounding for truncated multipliers
Author
Yoshida, N. ; Goto, E. ; Ichikawa, S.
Author_Institution
Dept. of Inf. Sci., Tokyo Univ., Japan
Volume
40
Issue
9
fYear
1991
fDate
9/1/1991 12:00:00 AM
Firstpage
1065
Lastpage
1067
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
Keywords
digital arithmetic; floating-point numbers; multiple-precision; multiplications; pseudorandom rounding; rounding; truncated multipliers; Chemicals; Computer architecture; Information science; Laboratories; Large scale integration; Logic; Magnetic flux; Numerical simulation; Quantum computing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.83650
Filename
83650
Link To Document