二进制数平方根计算的一种快速算法

A rapid algorithm about the square root of binary number

提出了计算二进制数平方根的一种快速算法,该法比许多参考书目所经常介绍的牛顿迭代法计算速度快。

In this paper a rapid algorithm about the square root of binary number is presented, this method is better than Newton's iteration process which is frequently in-troduced by many references to solve the second root of binary digit.