Accurate rounding scheme for the Newton-Raphson method using redundant binary representation
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 43 (1) , 43-51
- https://doi.org/10.1109/12.250608
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.<>Keywords
This publication has 4 references indexed in Scilit:
- A highly integrated 40-MIPS (peak) 64-b RISC microprocessorIEEE Journal of Solid-State Circuits, 1990
- A floating-point VLSI chip for the TRON architecture: an architecture for reliable numerical programmingIEEE Micro, 1989
- A 33 Mflops Floating Point Processor Using Redundant Binary RepresentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Design of high speed MOS multiplier and divider using redundant binary representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987