摘要 |
In a method for determining the square root of a long-bit number using a short-bit processor, the long-bit number is assumed to be cx22K+d, where c, d<22k, and its solution is assumed to be (ax2K+b)2. The "a' is determined by using a bisection method to obtain the floor value of the square root of "c'. In order to obtained the value of "b', there is derived a successive substitution equation: b[n]=(c-a2)x22k+(d-b[n-1]2)/22(k+1). An initial value is given to "b' to execute the successive substitution equation recursively several times until the equation is convergent.
|