DocumentCode
2434622
Title
Simplifying the rounding for Newton-Raphson algorithm with parallel remainder
Author
Piso, D. ; Bruguera, J.D.
Author_Institution
Dept. of Electron. & Comput. Eng., Univ. of Santiago de Compostela, Santiago de Compostela, Spain
fYear
2009
fDate
1-4 Nov. 2009
Firstpage
921
Lastpage
925
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.
Keywords
Newton-Raphson method; Newton-Raphson algorithm; parallel remainder; variable latency rounding method; Approximation algorithms; Concurrent computing; Delay; Design methodology; Equations; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 2009 Conference Record of the Forty-Third Asilomar Conference on
Conference_Location
Pacific Grove, CA
ISSN
1058-6393
Print_ISBN
978-1-4244-5825-7
Type
conf
DOI
10.1109/ACSSC.2009.5470011
Filename
5470011
Link To Document