Name
Abstract | ||
|---|---|---|
Contest (cone-oriented test pattern generator), an ATPG (automatic test pattern generation) tool for very large combinational digital circuits, is presented. Contest is based on four major ideas. Cone-oriented circuit partitioning reduces the circuit complexity and increases the number of dominators. The propagation graph is a dynamic data structure that keeps track of all paths from the fault location to a primary output. The multiple backtrace procedure reduces contradictory node assignments by examination of fanout nodes and dynamic implications. The pattern parallel fault dropping technique is based on Hamming distance variations of generated test patterns. Experimental results for benchmark circuits containing up to 40000 nodes illustrate the superiority of the ATPG system. For these circuits a 100% fault coverage for all detectable stuck-at faults and a 100% redundancy identification are achieved.<> |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/ICCAD.1990.129886 | Santa Clara, CA, USA |
Keywords | Field | DocType |
automatic testing,combinatorial circuits,logic CAD,logic testing,Contest,Hamming distance variations,automatic test pattern generation,benchmark circuits,circuit complexity,cone-oriented test pattern generator,detectable stuck-at faults,dynamic data structure,dynamic implications,fanout nodes,fast ATPG tool,pattern parallel fault dropping technique,propagation graph,redundancy identification,very large combinational circuits | Stuck-at fault,Automatic test pattern generation,Digital electronics,Fault coverage,Circuit complexity,Computer science,Algorithm,Combinational logic,Electronic engineering,Redundancy (engineering),Test compression | Conference |
Citations | PageRank | References |
8 | 2.36 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Udo Mahlstedt | 1 | 29 | 4.50 |
| Torsten Grüning | 2 | 8 | 2.36 |
| Cengiz Özcan | 3 | 8 | 2.36 |
| Wilfried Daehn | 4 | 111 | 23.22 |