scispace - formally typeset
Search or ask a question
Topic

Automatic test pattern generation

About: Automatic test pattern generation is a research topic. Over the lifetime, 8214 publications have been published within this topic receiving 140773 citations. The topic is also known as: ATPG.


Papers
More filters
Proceedings ArticleDOI
30 Sep 2003
TL;DR: An approach for reducing the test data volume that has to be stored in ATE vector memory for IC manufacturing testing is presented and the capabilities of pre- sent ATE to assign groups of input pins to ports and to perform vector repeat per port are exploited.
Abstract: paper presents an approach for reducing the test data volume that has to be stored in ATE vector memory for IC manufacturing testing. We exploit the capabilities of pre- sent ATE to assign groups of input pins to ports and to perform vector repeat per port. This allows run-length encoding of test stimuli per port. We improve the encoding byjlling the don't-care bits in the test stimuli, such that longer run-lengths are obtained. We provide a probabilis- tic analysis of the performance of vector repeat per port with various ATPG padding types. We further discuss the impact of ATE architectures. The paper provides experi- mental data for a set of large industrial circuits, which shows an average reduction of the test stimulus data vol- ume by a factor of 13.

37 citations

Proceedings ArticleDOI
27 Apr 2008
TL;DR: Experimental results for ISCAS89 benchmark circuits and two industry circuits show that the pattern count of KLPG can be significantly reduced (up to 3x compared to static compaction) using the proposed method.
Abstract: Dynamic compaction is an effective way to reduce the number of test patterns while maintaining high fault coverage. This paper proposes a new dynamic compaction algorithm for generating compacted test sets for K longest paths per gate (KLPG) in combinational circuits or scan-based sequential circuits. This algorithm uses a greedy approach to compact paths with non-conflicting assignments together during test generation. Experimental results for ISCAS89 benchmark circuits and two industry circuits show that the pattern count of KLPG can be significantly reduced (up to 3x compared to static compaction) using the proposed method. The pattern count after dynamic compaction is comparable to the number of transition fault tests, while achieving higher test quality.

37 citations

Proceedings ArticleDOI
25 Jun 1996
TL;DR: The computational overhead involved in the proposed procedure is significantly lower, yet short test sequences are obtained, and the techniques can be incorporated into other test generation procedures, to reduce the test lengths they produce.
Abstract: Short test sequences for synchronous sequential circuits are important in reducing test application time and memory requirements. In addition, dynamic test compaction, where heuristics to generate short test sequences are incorporated into the test generation process, may also reduce test generation time. This is due to the fact that a smaller number of test vectors needs to be generated. We present a dynamic test compaction procedure. The compaction heuristics we use are based on previously proposed static compaction techniques. Conventionally, static compaction is applied as a postprocessing step, after the test sequence has been generated. In the proposed procedure, static compaction techniques are used while the test sequence is being generated, to reduce the need for postprocessing, or static compaction. Compared to other dynamic compaction procedures that generate very short test sequences, the computational overhead involved in the proposed procedure is significantly lower, yet short test sequences are obtained. The proposed techniques can be incorporated into other test generation procedures, to reduce the test lengths they produce.

37 citations

Proceedings ArticleDOI
06 Apr 1993
TL;DR: A sequential test generation method based on Boolean satisfiability that produces near-minimal test sizes is presented and the authors discuss the flexibility provided by Boolean Satisfiability to extend the fault model to realistic faults.
Abstract: Presents a sequential test generation method based on Boolean satisfiability. The method produces near-minimal test sizes. The authors discuss the flexibility provided by Boolean satisfiability to extend the fault model to realistic faults. Experimental results using ISCAS-89 benchmark circuits and comparisons with previously published results are presented. >

37 citations

Proceedings ArticleDOI
02 Oct 1989
TL;DR: A complete test pattern generation system for path delay faults using PODEM using a 5-valued logic and criteria and efficient algorithms to prune the number of paths for test generation are presented.
Abstract: A complete test pattern generation system for path delay faults is presented. The test pattern generator is based on PODEM using a 5-valued logic. Techniques to prune the search space for test pattern generation are proposed. Since the number of paths for test generation can be exponential in the number of lines in the network, criteria and efficient algorithms to prune the number of paths for test generation are presented. The test generation system is evaluated using the ISCAS combinational benchmark circuits. >

37 citations


Network Information
Related Topics (5)
CMOS
81.3K papers, 1.1M citations
84% related
Logic gate
35.7K papers, 488.3K citations
84% related
Routing (electronic design automation)
41K papers, 566.4K citations
83% related
Field-programmable gate array
36K papers, 354.3K citations
83% related
Benchmark (computing)
19.6K papers, 419.1K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202338
202278
202125
202048
201980
201869