Share Email Print
cover

Proceedings Paper

An improved reciprocal approximation algorithm for a Newton Raphson divider
Author(s): Gaurav Agrawal; Ankit Khandelwal; Earl E. Swartzlander
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 21 September 2007
PDF: 12 pages
Proc. SPIE 6697, Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, 66970M (21 September 2007); doi: 10.1117/12.731650
Show Author Affiliations
Gaurav Agrawal, Univ. of Texas at Austin (United States)
Ankit Khandelwal, Univ. of Texas at Austin (United States)
Earl E. Swartzlander, Univ. of Texas at Austin (United States)


Published in SPIE Proceedings Vol. 6697:
Advanced Signal Processing Algorithms, Architectures, and Implementations XVII
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top