loading...
A New Low-Cost Method for Identifying Untestable Path Delay Faults
Singapore December 02-December 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ATS.1998.741591Seventh Asian Test Symposium (ATS'98)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Zhongcheng Li, Chinese Academy of Sciences
Yinghua Min, Chinese Academy of Sciences
Robert K. Brayton, University of California at Berkeley
In many designs a large portion of path delay faults is non-robustly untestable. This paper presents a new low-cost method for identifying non-robustly untestable path delay faults. Using an implication-based procedure, our method starts with a small number of path segments, called maximum fanout-free segments, to quickly locate lines which cannot construct non-robustly testable paths with them. After a large portion of faults is marked as untestable, only a small subset of faults remains to the ATPG procedure, which can effectively alleviate the problem of handling a huge number of path delay faults and reduce test generation time. Experimental results for ISCAS'85 benchmark circuits demonstrate that a significant portion of non-robustly untestable path delay faults was identified efficiently using our method. For most of these circuits, 90% - 95% of non-robustly untestable path delay faults can be identified within a small amount of CPU time.
Index Terms:
Delay testing, path delay fault, non-robustly untestable, implication.
Citation:
Zhongcheng Li, Yinghua Min, Robert K. Brayton, "A New Low-Cost Method for Identifying Untestable Path Delay Faults," ats, pp.76, Seventh Asian Test Symposium (ATS'98), 1998
Usage of this product signifies your acceptance of the Terms of Use.