Test set compaction algorithms for combinational circuits

@article{Hamzaoglu1998TestSC,
  title={Test set compaction algorithms for combinational circuits},
  author={Ilker Hamzaoglu and Janak H. Patel},
  journal={1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)},
  year={1998},
  pages={283-289}
}
  • Ilker Hamzaoglu, J. Patel
  • Published 1 November 1998
  • Engineering
  • 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)
This paper presents two new algorithms, Redundant Vector Elimination (RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under the single stuck at fault model, and a new heuristic for estimating the minimum single stuck at fault test set size. These algorithms together with the dynamic compaction algorithm are incorporated into an advanced ATPG system for combinational circuits, called MinTest. MinTest found better lower bounds and generated… 

Compact two-pattern test set generation for combinational and full scan circuits

This paper presents two algorithms for generating compact test sets for combinational and full scan circuits under the transition and CMOS stuck-open fault models; Redundant Vector Elimination (RVE)

Dynamic Compaction for High Quality Delay Test

TLDR
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.

A scalable method for the generation of small test sets

TLDR
A scalable method to generate close to minimal size test pattern sets for stuck-at faults in scan based circuits and guides the justification and propagation decisions to create patterns that will accommodate most targeted faults.

Efficient test relaxation techniques for combinational logic circuits

TLDR
This paper proposes a novel and efficient test relaxation technique for combinational circuits based on critical path tracing that is faster than the brute-force test relaxation method by several orders of magnitude.

A Brief Overview of Test Vector Compaction Methods for Combinational Circuits

This paper presents a history of test compaction methods and a brief overview of all available test compaction methods in the literature for combinational circuits that has come through various

Maximal Independent Fault Set for Gate-Exhaustive Faults

  • I. Pomeranz
  • Mathematics
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2021
TLDR
Gate-exhaustive faults have certain properties that can be used in the computation of independent fault sets that provide a lower bound on the number of tests, and can thus be used for evaluating the level of test compaction.

155 AN EFFICIENT TEST RELAXATION TECHNIQUE FOR COMBINATIONAL LOGIC CIRCUITS

TLDR
This paper proposes a novel and efficient test relaxation technique for combinational circuits based on critical path tracing that is faster than the brute-force test relaxation method by several orders of magnitude.

Static test compaction for diagnostic test sets of full-scan circuits

TLDR
The authors describe a static test compaction procedure that uses a diagnostic fault simulation process based on equivalence classes to identify tests that are not necessary for distinguishing fault pairs and includes an iterative reordering process whose goal is to increase the number of tests that will be identified as unnecessary.

On achieving minimal size test sets for scan designs

TLDR
Experimental evidence that digital VLSI circuit designs using an earlier proposed DFT method called segmented scan may be testable using fewer tests than needed for unsegmented scan versions of the same designs is provided.

A new approach to test generation and test compaction for scan circuits

  • I. PomeranzS. Reddy
  • Computer Science
    2003 Design, Automation and Test in Europe Conference and Exhibition
  • 2003
TLDR
A new approach to test generation and test compaction for scan circuits that eliminates the distinction between scan operations and application of primary input vectors is proposed, resulting in test sequences with the lowest known test application times for benchmark circuits.
...

References

SHOWING 1-10 OF 47 REFERENCES

COMPACTEST: A METHOD TO GENERATE COMPACT TEST SETS FOR COMBINATIONAL CIRCUITS

TLDR
Experimental results obtained by adding the proposed heuristics to a simple PODEM procedure and applying it to the ISCas-85 and fully-scanned ISCAS-89 benchmark circuits are presented to substantiate the effectiveness of the proposedHeuristics.

On compacting test sets by addition and removal of test vectors

TLDR
A method of test compaction for stuck-at faults in combinational circuits, that complements previously proposed methods and allows further reduction in test set size in a cost-effective way is presented.

Test set compaction for combinational circuits

TLDR
Two active compaction methods based on essential faults are developed to reduce a given test set, forced pair-merging and essential fault pruning, which achieves further compaction from removal of a pattern by modifying other patterns of the test set to detect the essential faults of the target pattern.

Minimal Test Sets for Combinational Circuits

  • G. Tromp
  • Mathematics, Computer Science
    1991, Proceedings. International Test Conference
  • 1991
TLDR
It is shown that for a class of circuits with a high fnult compatibility well-known test set compaction methods do not effectively minimize the test set, and an algorithm based on finding a maximal clique in a graph to estimate the size of a minimum test set is presented.

New Techniques for Deterministic Test Pattern Generation

TLDR
New techniques for speeding up deterministic test pattern generation for VLSI circuits by reducing number of backtracks with a low computational cost are presented and incorporated into an advanced ATPG system for combinational circuits called ATOM.

Cost-Effective Generation of Minimal Test Sets for Stuck-at Faults in Combinational Logic Circuits

TLDR
New cost-effective heuristics for the generation of small test sets and an improved procedure for computing independent fault sets which are used to selecet target faults in test generation are proposed.

ROTCO: a reverse order test compaction technique

In this paper, the authors consider the problem of reducing the test set sizes for single stuck-at faults in combinational logic circuits. They report on an alternative to the conventional reverse

Combinational profiles of sequential benchmark circuits

A set of 31 digital sequential circuits described at the gate level is presented. These circuits extend the size and complexity of the ISCAS'85 set of combinational circuits and can serve as

SOCRATES: a highly efficient automatic test pattern generation system

TLDR
SOCRATES includes several novel concepts and techniques that significantly improve and accelerate the automatic test pattern generation process for combinational and scan-based circuits based on the FAN algorithm, improved implication, sensitization, and multiple backtrace procedures.

On the Complexity of Estimating the Size of a Test Set

TLDR
This correspondence investigates the complexity of a more modest problem, that of estimating the size of a test set under the constraint that the circuit is irredundant, and shows that even this constrained problem is NP-hard in the strong sense.