DocumentCode
2343408
Title
An efficient method to identify untestable path delay faults
Author
Shao, Yun ; Reddy, Sudhakar M. ; Kajihara, Seiji ; Pomeranz, Irith
Author_Institution
Electr. & Comput. Eng. Dept., Iowa Univ., Iowa City, IA, USA
fYear
2001
fDate
2001
Firstpage
233
Lastpage
238
Abstract
Several methods to reduce the run time and memory requirements of a procedure used to efficiently identify untestable path delay faults are proposed in this work. Based on the correlation between the conditions required for sensitizing subpaths in the fan-out-free regions of a circuit, equivalence relations between the subpaths are defined. Equivalence relations are used to reduce the number of subpaths considered in the identification of untestable paths. Dynamic pruning of the potential search space for identifying pairs of subpaths that cannot be sensitized together is used to achieve additional speedup. Results on benchmark circuits show the effectiveness of the proposed methods
Keywords
automatic testing; combinational circuits; delays; fault diagnosis; logic testing; benchmark circuits; dynamic pruning; equivalence relations; memory requirements; run time; search space; untestable path delay faults; Benchmark testing; Circuit faults; Circuit testing; Cities and towns; Computer science; Delay effects; Fault diagnosis; Propagation delay; Robustness; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Test Symposium, 2001. Proceedings. 10th Asian
Conference_Location
Kyoto
ISSN
1081-7735
Print_ISBN
0-7695-1378-6
Type
conf
DOI
10.1109/ATS.2001.990287
Filename
990287
Link To Document