Accurate Rounding Scheme for the Newton-Raphson Method Using Redundant Binary Representation

Authors:
H. Kabuo;T. Taniguchi;A. Miyoshi;H. Yamashita;M. Urano;H. Edamatsu;S. Kuninobu
Affiliations:
-;-;-;-;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1994

Citing 2
Cited 3

Computer Arithmetic: Principles, Architecture and Design

Computer Arithmetic: Principles, Architecture and Design
A Floating-Point VLSI Chip for the TRON Architecture: An Architecture for Reliable Numerical Programming

IEEE Micro

Area and performance tradeoffs in floating-point divide and square-root implementations

ACM Computing Surveys (CSUR)
Division Algorithms and Implementations

IEEE Transactions on Computers
Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set

Journal of VLSI Signal Processing Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

Proposes a new algorithm of estimation and compensation of the error effect for rounding in the case of implementation of division and square root using the Newton-Raphson method. The authors analyze the error of the hardware system to confirm the condition of the implementation with respect to this algorithm. Next, they describe in detail how to compensate the error by using this algorithm. Finally, they show that the hardware components for this algorithm, the direct rounding mechanism in the recode circuit and the sticky digit generating circuit, can be realized simply by improving the redundant binary representation multiplier. The number of increasing cycles for this new algorithm is only one, and the rounding result using this algorithm satisfies IEEE Standard 754 rounding perfectly.