Vector sets for exhaustive testing of logic circuits
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (3) , 513-522
- https://doi.org/10.1109/18.6031
Abstract
(L, d)-universal sets are useful for exhaustively testing logic circuits with a large number of functional components, designed so that every functional component depends on at most d inputs. Randomized and deterministic constructions of ( L, d)-universal test sets are presented, and lower and upper bounds on the optimal sizes of such sets are proven. It is also proven that the design of an optimal exhaustive test set for an arbitrary logic circuit is an NP-complete problemKeywords
This publication has 10 references indexed in Scilit:
- Explicit construction of exponential sized families of k-independent setsDiscrete Mathematics, 1986
- Design of universal test sequences for VLSIIEEE Transactions on Information Theory, 1985
- Logic Test Pattern Generation Using Linear CodesIEEE Transactions on Computers, 1984
- Iterative Exhaustive Pattern Generation for Logic TestingIBM Journal of Research and Development, 1984
- Exhaustive Test Pattern Generation with Constant Weight VectorsIEEE Transactions on Computers, 1983
- On sets of Boolean n-vectors with all k-projections surjectiveActa Informatica, 1983
- Exhaustive Generation of Bit Patterns with Applications to VLSI Self-TestingIEEE Transactions on Computers, 1983
- The Complexity of Fault Detection Problems for Combinational Logic CircuitsIEEE Transactions on Computers, 1982
- Polynomially Complete Fault Detection ProblemsIEEE Transactions on Computers, 1975
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962