Journal article
Static test compaction for full-scan circuits based on combinational test sets and nonscan input sequences and a lower bound on the number of tests
IEEE transactions on computers, Vol.53(12), pp.1569-1581
12/2004
DOI: 10.1109/TC.2004.118
Abstract
A new class of static compaction procedures is described that generate test sets with reduced test application times for scan circuits. The proposed class of procedures combines the advantages of two earlier static compaction procedures, one that tends to generate large numbers of tests with a short primary input sequence included in every test and one that tends to generate small numbers of tests with a long, primary input sequence included in one of the tests. A procedure of the proposed class starts from an initial test set that has a large number of tests and long primary input sequences and it selects a subset of the tests and subsequences of their primary input sequences. It thus has the flexibility of finding an appropriate balance between the number of tests and the lengths of the primary input sequences in order to minimize the test application time. Several ways of computing the primary input sequences for the initial test set are considered. The most compact test sets are obtained when a test sequence for the nonscan circuit is available and this sequence is used as part of every test in the initial test set. However, it is shown that high levels of compaction can also be achieved without the overhead of test generation for the nonscan circuit. Specifically, we show that the industry practice of holding a primary input vector constant between scan operations can be accommodated. We estimate the ability of the procedure to achieve optimum test sets by computing a lower bound on the number of tests and demonstrating that the procedure achieves or approaches this lower bound.
Details
- Title: Subtitle
- Static test compaction for full-scan circuits based on combinational test sets and nonscan input sequences and a lower bound on the number of tests
- Creators
- Irith Pomeranz - Purdue University West LafayetteSudhakar M Reddy - IEEE#TAB#
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on computers, Vol.53(12), pp.1569-1581
- DOI
- 10.1109/TC.2004.118
- ISSN
- 0018-9340
- eISSN
- 1557-9956
- Publisher
- IEEE
- Language
- English
- Date published
- 12/2004
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197326902771
Metrics
14 Record Views