Abstract: 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.

Abstract: 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 effectively form the reciprocal of the binary divisor, most significant bit first, by successive approximation. Control circuitry, including a carry detector, dictates the formation of the shift and add sequence that effectively represents the reciprocal of the divisor by controlling the positioning of the divisor before each addition step so that the product is a series of binary ones. The add and shift sequence utilized to generate the series of binary ones, as it is evolving, is also being utilized to manipulate the dividend, thereby forming the quotient, most significant bit first.

Abstract: A plurality of modular arrays, each structured from a common module, are connected together so as to form a binary quotient by successive approximations. For divisors that fall into that group of numbers that have reciprocals with a reasonably short period, the forming of a quotient with such a divisor and any dividend can be greatly accelerated after the add and shift sequence for the first period of the divisor reciprocal is obtained. A unity array, divisor array, dividend array, and quotient array may all be of equal length, but must be longer than the length of the periods of the reciprocals of the divisors utilized. The reciprocal of the divisor is effectively formed in the divisor array by generating a shift and add sequence that will produce a product that is a series of binary ones. After the first period of the divisor reciprocal is formed, the binary bits of the reciprocal start to repeat for the second period, and so on.