A systematic method for division with high average bit skipping
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 39 (1) , 127-130
- https://doi.org/10.1109/12.46287
Abstract
It is shown that, if a division is described by AQ=C, where A is the divisor, Q is the quotient, and C is the dividend, then the bit variables involved in a set of equations, each of which determines a leading bit of C, gives an approximation for Q that an be used in a SRT division scheme. The results of an exhaustive statistical simulation, using all possible combinations of two pairs of integers 12 b in length, in normalized form, representing A and C are presented to validate the method.Keywords
This publication has 8 references indexed in Scilit:
- A Suggestion for a High-Speed Parallel Binary DividerIEEE Transactions on Computers, 1972
- Higher-Radix Division Using Estimates of the Divisor and Partial RemaindersIEEE Transactions on Computers, 1968
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964
- 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
- A New Class of Digital Division MethodsIRE Transactions on Electronic Computers, 1958
- TECHNIQUES OF MULTIPLICATION AND DIVISION FOR AUTOMATIC BINARY COMPUTERSThe Quarterly Journal of Mechanics and Applied Mathematics, 1958