Browse > Article

Initial Point Optimization for Square Root Approximation based on Newton-Raphson Method  

Choi Chang-Soon (Dept. of Electronic Engineering, Program of Integrated Biotechnology and IDEC, Sogang University)
Lee Jin-Yong (Dept. of Electronic Engineering, Program of Integrated Biotechnology and IDEC, Sogang University)
Kim Young-Lok (Dept. of Electronic Engineering, Program of Integrated Biotechnology and IDEC, Sogang University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.43, no.3, 2006 , pp. 15-20 More about this Journal
Abstract
A Newton-Raphson Method for table driven algorithm is presented in this paper. We concentrate the approximation of square root by using Newton-Raphson method. We confirm that this method has advantages of accurate and fast processing with optimized initial point. Hence the selection of the fitted initial points used in approximation of Newton-Raphson algorithm is important issue. This paper proposes that log scale based on geometric wean is most profitable initial point. It shows that the proposed method givemore accurate results with faster processing speed.
Keywords
Newton-Raphson; square root; iteration;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Reza Hashemian 'Square Rooting Algorithm for Integer and Floating-Point Numbers', IEEE Transactions on Computers, Vol.39. No.8. August, 1990   DOI   ScienceOn
2 Ryuki Kawamata and Shugang Wei 'Suqare Rooting Algorithm Using Signed-Digit Arithmetic' ITC-CSCC2005, Vol.2. pp.559-560, July, 2005
3 Behrooz Parhami 'Computer Arithmetic Algorithms and Hardware Designs' Oxford University Press, New York, 2000
4 M.J.Schulte and E.E.Swartzlander Jr, ' Hardware desing for exactly rounded elementary functions', IEEE Transactions on Computers 43.8. pp.964-973, 1994   DOI   ScienceOn