DocumentCode
1019293
Title
An efficient nonenumerative method to estimate the path delay fault coverage in combinational circuits
Author
Pomeranz, Irith ; Reddy, Sudhakar M.
Author_Institution
Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA
Volume
13
Issue
2
fYear
1994
fDate
2/1/1994 12:00:00 AM
Firstpage
240
Lastpage
250
Abstract
A method to estimate the coverage of path delay faults of a given test set, without enumerating paths, is proposed. The method is polynomial in the number of lines in the circuit, and thus allows circuits with large numbers of paths to be considered under the path delay fault model. Several levels of approximation, with increasing accuracy and increasing polynomial complexity, are proposed. Experimental results are presented to show the effectiveness and accuracy of the estimate in evaluating the path delay fault coverage. Combining this nonenumerative estimation method with a test generation method for path delay faults would yield a cost effective method to consider path delay faults in large circuits, which are beyond the capabilities of existing test generation and fault simulation procedures, that are based on enumeration of paths
Keywords
combinatorial circuits; computational complexity; delays; logic testing; combinational circuits; cost effective method; first order approximation; large circuits; nonenumerative method; path delay fault coverage; polynomial complexity; test generation method; test set; timing behaviour; zero order approximation; Circuit faults; Circuit simulation; Circuit testing; Costs; Delay effects; Delay estimation; Electrical fault detection; Fault detection; Polynomials; Yield estimation;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.259947
Filename
259947
Link To Document