Shanker Singh

Multiple Operand Addition and Multiplication

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.

A probabilistic approach for testing large-scale integrated circuits

If the statistics available from various process steps involved in the fabrication of large-scale integrated logic circuit chips indicate that the computed probability of each circuit path operating properly is greater than 1/2, then a reliable screening test procedure can be devised. A reliable reference standard from untested chips, or modules, can be constructed, and such a standard reference can be used in all test procedures in which circuit testing is based on comparison.

Multiple operand addition and multiplication

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.