The pseudoexhaustive test of sequential circuits
Authors:
- S. HellebrandSHS. Hellebrand
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 11 (1) , 26-33
Abstract
The concept of a pseudoexhaustive test for sequential circuits is introduced in a way similar to that which is used for combinational networks. Using partial scan all cycles in the data flow of a sequential circuit are removed, such that a compact combinational model can be constructed. Pseudoexhaustive test sequences for the original circuit are constructed from a pseudoexhaustive test set for this model. To make this concept feasible for arbitrary circuits a technique for circuit segmentation is presented which provides special segmentation cells as well as the corresponding algorithms for the automatic placement of the cells. Example circuits show that the test strategy requires less additional silicon area than a complete scan path. Thus the advantages of a partial scan path are combined with the well-known benefits of a pseudoexhaustive test, such as high fault coverage and simplified test generationKeywords
This publication has 14 references indexed in Scilit:
- Partitioning circuits for improved testabilityAlgorithmica, 1991
- Hochintegrierte Schaltungen: Prüfgerechter Entwurf und Test1991
- An analytical approach to the partial scan problemJournal of Electronic Testing, 1990
- Designing circuits with partial scanIEEE Design & Test of Computers, 1988
- LOCST: A Built-In Self-Test TechniqueIEEE Design & Test of Computers, 1984
- Verification Testing—A Pseudoexhaustive Test TechniqueIEEE Transactions on Computers, 1984
- Exhaustive Generation of Bit Patterns with Applications to VLSI Self-TestingIEEE Transactions on Computers, 1983
- Design for Autonomous TestIEEE Transactions on Computers, 1981
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975
- Note—A Computational Survey of Methods for the Set Covering ProblemManagement Science, 1975