Minimal Square Rooting

Binary square rooting algorithms which yield a root in a redundant representation using digits 1, ?1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the square root is developed.

[1]  C. V. Freiman,et al.  Statistical Analysis of Certain Binary Division Algorithms , 1961, Proceedings of the IRE.

[2]  D. Cowgill,et al.  Logic Equations for a Built-In Square Root Method , 1964, IEEE Transactions on Electronic Computers.

[3]  Gernot Metze,et al.  A Class of Binary Divisions Yielding Minimally Represented Quotients , 1962, IRE Trans. Electron. Comput..