K차 뉴톤-랍손 부동소수점수 N차 제곱근
Kth order Newton-Raphson's Floating Point Number Nth Root
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, a tentative Kth order Newton-Raphson's floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Newton-Raphson root algorithm. Using the proposed algorithm, and can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration and iterates only until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.
Abstract
In this paper, a tentative Kth order Newton-Raphson's floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Newton-Raphson root algorithm. Using the proposed algorithm, and can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration and iterates only until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.
참고문헌 (13)
- V. Lappalainen, "Overview of Research Efforts on Media ISA Extension and Their Usage in Video Coding", IEEE Transactions on Circuits and Systems for Video Technology, 12, pp.660~670 (2002)[DOI]
- R.B. Lee, "Multimedia Extensions for General Purpose Processor", Proceedings of IEEE Workshop on Signal Processing Systems, pp.9~23 (1997)
- C. Shuang-yan, "Design and Implementation of a 64", 32-bit Floating-point Division, Reciprocal, Square Root, and Inverse Square Root Unit, 2006, 1976~1979
- F. Dubeau, "nth Root extraction: Double iteration process and Newtons's method", Journal of Computational and Applied Mathematics, 91, pp.191~198 (1998)[DOI]
- S.G. Chen, "Fast Computation of the Nth Root", Computers & Mathematics Applications, 17(10), pp.1423~1427 (1989)[DOI]
- IEEE, "IEEE Standard for Binary Floating-Point Arithmetic, ANSI", IEEE Standard, Std. 754-1985, 1985
- J.M. Gutierrez, "Calculus of nth Roots and Third Order Iterative Methods", Nonlinear Analysis: Theory, Methods & Applications, 47(4), pp.2875~2880 (2001)[DOI]
- F. Dubeau, "Newton's Method and High-order Algorithm for the n-th Root Computation", Journal of Computational and Applied Mathematics, 224(1), pp.66~76 (2009)[DOI]
- S.F. Oberman, "Design Issues in Division and Other Floating Point Operations", IEEE Transactions on Computer, C-46, pp.154~161 (1997)
- 김성기, "가변 시간 골드스미트 부동소수점 제곱근 계산기", 한국정보통신학회논문지, 9(1), pp.188~198 (2005), 한국정보통신학회
- 김성기, "가변 시간 뉴톤-랍손 부동소수점 역수 제곱근 계산기", 정보처리학회논문지. 컴퓨터 및 통신시스템, 12(5), pp.413~420 (2005), 한국정보처리학회
- 조경연, "가변 시간 K차 뉴톤-랍손 부동소수점 나눗셈", 대한임베디드공학회논문지, 9(5), pp.285~292 (2014), 대한임베디드공학회[DOI]
- D. DasSarma, "Measuring and Accuracy of ROM Reciprocal Tables", IEEE Transactions on Computer, 43(8), pp.932~930 (1994)[DOI]