Name
Abstract | ||
|---|---|---|
Testing for small-delay defects (SDDs) requires fault-effect propagation along the longest testable paths. However, identification of the longest testable paths requires high CPU time, and the sensitization of all such paths leads to large pattern counts. Dynamic test compaction for small-delay defects is therefore necessary to reduce test-data volume. We present a new technique for identifying the longest testable paths through each gate in order to accelerate test generation for SDDs. The resulting test patterns sensitize the longest testable paths that pass through each SDD site. An efficient dynamic test compaction method based on structural analysis is presented to reduce the pattern count substantially, while ensuring that all the longest paths for each SDD are sensitized. Simulation results for a set of ISCAS 89 and IWLS 05 benchmark circuits demonstrate the effectiveness of this method. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2491477.2491488 | ACM Trans. Design Autom. Electr. Syst. |
Keywords | Field | DocType |
sdd site,longest testable path,effective path selection scheme,small-delay defect,pattern count,test generation,dynamic test compaction,longest path,resulting test pattern,efficient dynamic test compaction,large pattern count | Dynamic compaction,Computer science,CPU time,Parallel computing,Test compaction,Algorithm,Real-time computing,Dynamic testing,Electronic circuit,Compaction | Journal |
Volume | Issue | ISSN |
18 | 3 | 1084-4309 |
Citations | PageRank | References |
6 | 0.43 | 36 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dong Xiang | 1 | 528 | 48.34 |
| Jianbo Li | 2 | 46 | 28.87 |
| K Chakrabarty | 3 | 8173 | 636.14 |
| Xijiang Lin | 4 | 687 | 42.03 |