Simplifying the rounding for Newton-Raphson algorithm with parallel remainder

Authors:
D. Piso;J. D. Bruguera
Affiliations:
Dept. of Electronics and Computer Engineering, University of Santiago de Compostela;Dept. of Electronics and Computer Engineering, University of Santiago de Compostela
Venue:
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Year:
2009

Citing 3
Cited 0

Design Issues in Division and Other Floating-Point Operations

IEEE Transactions on Computers
Division and Square Root: Digit-Recurrence Algorithms and Implementations

Division and Square Root: Digit-Recurrence Algorithms and Implementations
Rounding for Quadratically Converging Algorithms for Division and Square Root

ASILOMAR '95 Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a variable latency rounding method based on the calculation in parallel of a remainder estimation for Newton-Raphson algorithm. The value obtained is the remainder of the algorithm result without any transformation. Because of this a new rounding method based on this value has to be proposed. This method avoid the traditional remainder calculation in 91% of the cases for division and 88% of the cases for square root.