Skewed-Load Transition Test: Part I, Calculus

A skewed-load transition test is a delay test where the second vector of the delay test pair is a one bit shift over the first vector in the pair. This situation occurs in principle when testing the combinational logic residing between scan chains. In the skewedload test protocol, in order not to disturb the logic initialized by the first vector of the delay test pair, the second vector of the pair (the one that launches the transition) is required to be the next (i.e. one bit-shift) pattern in the scan chain. This paper describes a calculus that allows one to compute the complete set of skewed-load transition test vectors. The calculus is capable of simultaneously computing both the first and second vector of the delay test pair. Probabilistic analysis of random pattern skewedload-based transition test is also discussed in this paper. We show how to extend both the ParkerMcCluskey algorithm and the cutting algorithm to compute detection probability of transition faults.

[1]  Jacob Savir,et al.  AT-SPEED TEST IS NOT NECESSARILY AN AC TEST , 1991, 1991, Proceedings. International Test Conference.

[2]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[3]  Barry K. Rosen,et al.  Comparison of AC Self-Testing Procedures , 1983, ITC.

[4]  Orest Bula,et al.  Gross delay defect evaluation for a CMOS logic design system product , 1990 .

[5]  J. Savir.  Improved cutting algorithm , 1990 .

[6]  Jr. Sheldon B. Akers,et al.  On a Theory of Boolean Functions , 1959 .

[7]  Irving S. Reed,et al.  Path Sensitization, Partial Boolean Difference, and Automated Fault Diagnosis , 1972, IEEE Transactions on Computers.

[8]  Thomas W. Williams,et al.  A logic design structure for LSI testability , 1977, DAC '77.

[9]  Gordon L. Smith,et al.  Model for Delay Faults Based upon Paths , 1985, ITC.

[10]  Jacob Savir,et al.  On Random Pattern Test Length , 1984, IEEE Transactions on Computers.

[11]  John A. Waicukauski,et al.  On computing the sizes of detected delay faults , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Edward J. McCluskey,et al.  Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.

[13]  Gary S. Ditlow,et al.  Random Pattern Testability , 1984, IEEE Transactions on Computers.

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