Modular apparatus for binary quotient, binary product, binary sum and binary difference generation
AssigneeBurroughs Corporation
InventorWalter Scott Bennett
Life of this patent
Estimating the term…
Loading patent…
AssigneeBurroughs Corporation
InventorWalter Scott Bennett
Estimating the term…
Three modular arrays structured from a common module are connected together a first way to form a binary quotient by successive approximations, or a second way to form a binary product. Any one of the three modular arrays may be used to add or subtract two binary numbers. To divide, one array is utilized to generate a shift and add sequence that represents the reciprocal of the divisor, most significant bit first. As this add and shift sequence is being formed, it is, at the same time, being utilized to manipulate the dividend, thereby forming the quotient, most significant bit first. In effect, the dividend is being multiplied by the reciprocal of the divisor so as to form a product of the dividend and reciprocal of the divisor, most significant bit first. This product is actually the quotient of the dividend and divisor. The binary product of two numbers is formed, most significant bit first, by manipulating the multiplicand according to an add and shift sequence determined by use of the multiplier.
A high-speed divider for binary numbers, comprising:
A divider for dividing a dividend digital pattern by a divisor digital pattern to form a quotient digital pattern, comprising:
An arithmetic mechanism for binary numbers, comprising:
Dependencies are inferred from the claim text.