Binary Square Root
Binary Square Root
(OP)
I am looking for a detailed explanation of finding the square root of a binary number (16 bit). I have seen it done using decimal numbers (Newtonian method) and some other methods. I would like to implement this in assembly language using rotate commands and an 8bit software multiply. Can anyone help (I know this is from high school - at least the decimal long hand square root is)?





RE: Binary Square Root
input number
sq = guess
loop:
guess = (number/guess+guess)/2
loop until changes
sqr=guess
<nbucska@pcperipherals DOT com> subj: eng-tips
RE: Binary Square Root
<nbucska@pcperipherals DOT com> subj: eng-tips
RE: Binary Square Root
RE: Binary Square Root
integer solution.
<nbucska@pcperipherals DOT com> subj: eng-tips
RE: Binary Square Root
RE: Binary Square Root
you might try quaternion operators popularized by Jack B. Kuipers. often used in games to speed up the graphics whether 8, 32, or 64 bit
RE: Binary Square Root
http://www.dattalo.com/technical/theory/sqrt.html
RE: Binary Square Root
http://www.rism.com/Trig/square.htm
RE: Binary Square Root
RE: Binary Square Root
RE: Binary Square Root
RE: Binary Square Root
"successive approximation root assembler" and found
http://www.finesse.demon.co.uk/steven/sqrt.html
which even had the code for several different ASM routines, varying in method and runtime.
Howard