An improved reciprocal approximation algorithm for a Newton Raphson divider

Newton Raphson Functional Approximation is an attractive division strategy that provides quadratic convergence. With appropriate computational resources, it can be faster than digit recurrence methods if an accurate initial approximation is available. Several table lookup based initial approximation methods have been proposed previously. This paper examines some of these methods and implements a 24 bit divider utilizing a ROM smaller than 1 Kb. A Taylor series based reciprocal approximation method is used that employs a table lookup followed by multiplication. Simulations confirm that the design achieves desired accuracy after one Newton Raphson iteration.

[1]  Zhan Guo,et al.  Design and implementation of reciprocal unit , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[2]  D.L. Fowler,et al.  An accurate, high speed implementation of division by reciprocal approximation , 1989, Proceedings of 9th Symposium on Computer Arithmetic.

[3]  Naofumi Tal,et al.  Generating a Power of an Operand by a Table Look-up and a Multiplication , 1997 .

[4]  Naofumi Takagi Generating a power of an operand by a table look-up and a multiplication , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[5]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[6]  Michael J. Flynn,et al.  Design Issues in Division and Other Floating-Point Operations , 1997, IEEE Trans. Computers.