Title :
Minimal Square Rooting
Author_Institution :
Coordinated Science Lab., University of Illinois, Urbana, Ill.
fDate :
4/1/1965 12:00:00 AM
Abstract :
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.
Keywords :
Algorithm design and analysis; Boolean functions; Circuit synthesis; Combinational circuits; Digital arithmetic; Laboratories; Logic design; Minimization methods; Sufficient conditions; Switching circuits;
Journal_Title :
Electronic Computers, IEEE Transactions on
DOI :
10.1109/PGEC.1965.263963
