IEEE Transactions on Electronic Computers · 1965 · 27 citations · 2 references
ComputingComputer EngineeringComputer ScienceAlgorithmsRepresentation TheoryComputational ComplexityNumber-theoretic AlgorithmsRoot FindingRedundant ComputationRedundant EncodingRoot Finding Algorithms
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.
2
Statistical Analysis of Certain Binary Division Algorithms
C. Freiman · Proceedings of the IRE · 1961 · 53 citations