Skip to main content
Article thumbnail
Location of Repository

A Newton Raphson Divider Based on Improved Reciprocal Approximation Algorithm

By High Speed, Computer Arithmetic, Gaurav Agrawal and Ankit Khandelwal

Abstract

Newton Raphson Functional Approximation is an attractive division strategy as it provides quadratic convergence and can be faster than digit recurrence methods if an accurate initial approximation is available. In this project, we study and simulate several table-lookup based initial approximation methods. Of particular interest is the Taylor Series based reciprocal approximation method which uses a table lookup followed by a multiplication for initial approximation and can provide a very accurate approximation with a very small ROM size. We implemented and simulated a 24 bit divider based on various methods published in literature and also proposed an improvement that retains accuracy while using a much smaller ROM

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.725
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ece.utexas.edu/~agr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.