Nonenumerative path delay fault coverage estimation with optimal algorithms

A recent method proposed that a lower bound on the number of path delay faults excited by a given test set can be computed using a set independent lines that form a cut. For each line in the cut a subcircuit consisting of all paths that contain the line is defined, and a lower bound to the number of excited path delay faults can be obtained by working on the respective subcircuits. A polynomial time algorithm is presented here for computing the maximum cardinality set of independent circuit lines. Experimental results show that the more the subcircuits the better the lower bound on the number of excited path delay faults is. More subcircuits may be generated only in a heuristic manner. It was proposed to consider two or more line-disjoint cuts C/sub i/. We propose a technique where only one C/sub i/ must be a cut. This scheme is based on novel algorithms, and results in more subcircuits than the previous one.

[1]  Kwang-Ting Cheng,et al.  Delay testing for non-robust untestable circuits , 1993, Proceedings of IEEE International Test Conference - (ITC).

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Michael H. Schulz,et al.  Advanced automatic test pattern generation techniques for path delay faults , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[4]  Janak H. Patel,et al.  Improving accuracy in path delay fault coverage estimation , 1996, Proceedings of 9th International Conference on VLSI Design.

[5]  Sudhakar M. Reddy,et al.  Fast Identification of Robust Dependent Path Delay Faults , 1995, 32nd Design Automation Conference.

[6]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[7]  Fanica Gavril,et al.  Algorithms for maximum k-colorings and k-coverings of transitive graphs , 1987, Networks.

[8]  Irith Pomeranz,et al.  An efficient nonenumerative method to estimate the path delay fault coverage in combinational circuits , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  John J. Shedletsky,et al.  An Experimental Delay Test Generator for LSI Logic , 1980, IEEE Transactions on Computers.

[10]  Vishwani D. Agrawal,et al.  An Efficient Path Delay Fault Coverage Estimator , 1994, 31st Design Automation Conference.

[11]  Kenneth D. Wagner,et al.  The Error Latency of Delay Faults in Combinational and Sequential Circuits , 1985, ITC.

[12]  Jacob Savir,et al.  Random Pattern Testability of Delay Faults , 1988, IEEE Trans. Computers.

[13]  Sudhakar M. Reddy,et al.  On Delay Fault Testing in Logic Circuits , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Robert K. Brayton,et al.  Delay Fault Coverage and Performance Tradeoffs , 1993, 30th ACM/IEEE Design Automation Conference.