A linear-time divider array

Two-dimensional combinational arrays for binary division are described in this paper. A new design that generates the quotient in 0(n) time is described in detail. It is compared with earlier 0(n²) and 0(n log n) arrays. For the practical operand range of 16 through 64 bits, the 0(n) array is faster and less expensive than the 0(n log n) array. The new array also has the advantage that its logic arrangement has a more regular structure than the 0(n log n) array, and is therefore potentially more amenable to LSI implementation.