Issue No.02 - February (1973 vol.22)
S. Singh , Systems Development Laboratories, IBM Corporation
The problem of adding k n-bit numbers, where k = 3 is considered. A novel scheme for adding such k numbers is described. Applying the bit-partitioning technique so that each partition contains m bits of each of these k numbers, where m=[log2(k-1)] is an integer = log2(k-1), the final sum can be obtained in m+1 addition cycles.
Binary arithmetic, binary multiplier, bit partitioning, multioperand adder, partial product array, pipelining.
S. Singh, R. Waxman, "Multiple Operand Addition and Multiplication", IEEE Transactions on Computers, vol.22, no. 2, pp. 113-120, February 1973, doi:10.1109/T-C.1973.223670