The pseudoexhaustive test of sequential circuits

The concept of a pseudoexhaustive test for sequential circuits is introduced. Instead of test sets one applies pseudoexhaustive test sequences of a limited length, which provides well-known benefits as far as fault coverage, self-test capability, and simplicity of test generation are concerned. Some flip flops and latches are integrated into an incomplete scan path, such that each possible state of the circuit is reachable within a few steps. Some more flip flops and some new segmentation cells are added to the partial scan path in order to make a pseudoexhaustive test feasible. Algorithms for placing these devices automatically are presented. Also it is shown how to transform a pseudoexhaustive test set into a pseudoexhaustive test sequence of a similar size. The analyzed examples show that a conventional complete scan path without additional testability features requires more hardware overhead than the proposed test strategy, which retains all the known benefits of a pseudoexhaustive test.<<ETX>>

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

[2]  Hans-Joachim Wunderlich,et al.  Generating pattern sequences for the pseudo-exhaustive test of MOS-circuits , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[3]  Edward J. McCluskey,et al.  Circuits for Pseudo-Exhaustive Test Pattern Generation. , 1986 .

[4]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

[5]  Donald T. Tang,et al.  Logic Test Pattern Generation Using Linear Codes , 1984, IEEE Transactions on Computers.

[6]  Hans-Joachim Wunderlich,et al.  Tools and devices supporting the pseudo-exhaustive test , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[7]  Arno Kunzmann,et al.  An analytical approach to the partial scan problem , 1990, J. Electron. Test..

[8]  V.D. Agrawal,et al.  Designing circuits with partial scan , 1988, IEEE Design & Test of Computers.

[9]  Edward J. McCluskey,et al.  Design for Autonomous Test , 1981, IEEE Transactions on Computers.

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

[11]  K.-T. Cheng,et al.  A Partial Scan Method for Sequential Circuits with Feedback , 1990, IEEE Trans. Computers.

[12]  Hans-Joachim Wunderlich,et al.  The design of random-testable sequential circuits , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

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

[14]  Johnny J. LeBlanc,et al.  LOCST: A Built-In Self-Test Technique , 1984, IEEE Design & Test of Computers.

[15]  Thomas W. Williams,et al.  A logic design structure for LSI testability , 1977, DAC '77.

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

[17]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

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