IRE Transactions on Electronic Computers · 1962 · 16 citations · 4 references
ComputingComputer EngineeringComputer ScienceAlgorithmsCombinatoricsNumber TheoryComputational Number TheoryNumber-theoretic AlgorithmsDivision Algorithms
Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or -1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ⅗≤|D|≤¾. This method is extended to yield minimally represented quotients for all normalized divisors.
4
High-Speed Arithmetic in Binary Computers
O. L. Macsorley · Proceedings of the IRE · 1961 · 622 citations
Statistical Analysis of Certain Binary Division Algorithms
C. Freiman · Proceedings of the IRE · 1961 · 53 citations