Original Publication Date: 1979-Jun-01
Included in the Prior Art Database: 2005-Feb-20
In many computer programs the divide algorithm requires an abnormally high amount of time to execute because the leading edge zeros in the quotient must be computed even though the vast majority of all combinations of divisors and dividends result in a large number of meaningless leading edge zeros. Also, once all "one" bits of the quotient have been computed and the remainder becomes zero, many trailing edge zeros may be needlessly computed. The program shown in the attached flow diagrams is designed to eliminate the computation of all leading edge zeros and to automatically terminate computation once all "one" bits of the quotient are found and the remainder is zero.