By Topic

Digit-recurrence algorithms for division and square root with limited precision primitives

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ercegovac, M.D. ; Comput. Sci. Dept., California Univ., Los Angeles, CA, USA ; Muller, J.-M.

We propose a digit-recurrence algorithm for square root using limited-precision multipliers, adders, and table-lookups. The algorithm, except in the initialization, uses the digit-recurrence algorithm for division with limited-precision primitives reported in (M.D. Ercegovac, et al., (2001)). Consequently, a combined scheme for division and square root is easily realized. We describe the algorithms and discuss a combined division/square-root design. Compared to a conventional implementation with full-precision primitives, the proposed scheme is estimated to have a longer cycle time and a significantly smaller area with a corresponding effect on power dissipation making the scheme interesting for low-power designs. This class of algorithms is suitable for higher radix implementation.

Published in:

Signals, Systems and Computers, 2004. Conference Record of the Thirty-Seventh Asilomar Conference on  (Volume:2 )

Date of Conference:

9-12 Nov. 2003