A Class of Binary Divisions Yielding Minimally Represented Quotients
- 1 December 1962
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IRE Transactions on Electronic Computers
- Vol. EC-11 (6) , 761-764
- https://doi.org/10.1109/tec.1962.5219460
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- An Algorithm for Rapid Binary DivisionIEEE Transactions on Electronic Computers, 1961
- Statistical Analysis of Certain Binary Division AlgorithmsProceedings of the IRE, 1961
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961
- TECHNIQUES OF MULTIPLICATION AND DIVISION FOR AUTOMATIC BINARY COMPUTERSThe Quarterly Journal of Mechanics and Applied Mathematics, 1958