Shanker Singh
IBM
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Shanker Singh.
IEEE Transactions on Computers | 1973
Shanker Singh; Ronald Waxman
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.
International Journal of Parallel Programming | 1978
Shanker Singh; Vijendra P. Singh
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.
national computer conference | 1972
Shanker Singh; Ronald Waxman
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.
Archive | 1993
Shanker Singh
Archive | 1998
Shanker Singh; Joe-Ming Cheng; Brent Cameron Beardsley; Dell Patrick Leabo; Forrest Lee Wade; Michael Thomas Benhase; Marc E. Goldfeder
Archive | 1983
Shanker Singh; Vijendra P. Singh
Archive | 1999
Brian Jeffrey Corcoran; Shanker Singh
Archive | 1998
Joe-Ming Cheng; Shanker Singh
Archive | 1999
Brian Jeffrey Corcoran; John Lewis Hufferd; Shanker Singh
Archive | 2000
Charles A. Kilmer; Shanker Singh