Skip to Main Content
Digital Arithmetic
book

Digital Arithmetic

by Miloš D. Ercegovac, Tomás Lang
September 2003
Intermediate to advanced content levelIntermediate to advanced
709 pages
26h 51m
English
Morgan Kaufmann
Content preview from Digital Arithmetic
360 c H r p T E P ~ Square Root by Digit Recurrence
6.14
6~
Determine a result-digit selection function for a radix-4 square root algorithm
with p--1 and carry-save residual. Give only the portion for selection of
Sj+ 1 =2.
Further Readings
A survey of square-root algorithms is presented in Montuschi and Mezzalama
(1990). Parts of this chapter are based on the monograph Ercegovac and Lang
(1994) which presents an in-depth study of digit-recurrence methods for division
and square root.
Early work in square rooting algorithms with redundancy in the result-digit
set to maximize the number of zero digits is developed in Metze (1967). ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Computer Arithmetic in Practice

Computer Arithmetic in Practice

Sławomir Gryś

Publisher Resources

ISBN: 9781558607989