Bounds on pseudoexhaustive test lengths

Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we have derived both generic (cone-independent) and circuit-specific (cone-dependent) bounds on the minimal length of a test required so that each cone in a circuit is exhaustively tested. For any circuit with five or fewer outputs, and where each output has k or fewer inputs, we show that the circuit can always be pseudoexhaustively tested with just 2/sup k/ patterns. We derive a tight upper bound on pseudoexhaustive test length for a given circuit by utilizing the knowledge of the structure of the circuit output cones. Since our circuit-specific bound is sensitive to the ordering of the circuit inputs, we show how the bound can be improved by permuting these inputs.

[1]  S. B. Akers,et al.  On the use of linear sums in exhaustive testing , 1987 .

[2]  Hans-Joachim Wunderlich,et al.  Generating pseudo-exhaustive vectors for external testing , 1990, Proceedings. International Test Conference 1990.

[3]  Melvin A. Breuer,et al.  An Efficient Partitioning Strategy for Pseudo-Exhaustive Testing , 1993, 30th ACM/IEEE Design Automation Conference.

[4]  M. Newman,et al.  Topics in Algebra , 1978 .

[5]  Edward J. McCluskey,et al.  Circuits for pseudoexhaustive test pattern generation , 1986, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Spyros Tragoudas,et al.  Cost-effective LFSR synthesis for optimal pseudoexhaustive BIST test sets , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Edward J. McCluskey.  Verification Testing - A Pseudoexhaustive Test Technique , 1984, IEEE Trans. Computers.

[8]  Wen-Ben Jone,et al.  A Coordinated Approach to Partitioning and Test Pattern Generation for Pseudoexhaustive Testing , 1989, 26th ACM/IEEE Design Automation Conference.

[9]  Chien-In Henry Chen.  BISTSYN-a built-in self-test synthesizer , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[10]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[11]  Arnold L. Rosenberg,et al.  Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing , 1983, IEEE Transactions on Computers.

[12]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[13]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[14]  J. G. Udell,et al.  Reconfigurable hardware for pseudoexhaustive test , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[15]  Melvin A. Breuer,et al.  Novel test pattern generators for pseudo-exhaustive testing , 1993, Proceedings of IEEE International Test Conference - (ITC).