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.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.