Motivated by the work of K. Kim et al. (1988) and A. Krasniewski and S. Pilarski (1989), the problem of test efficiency in random testing of sequential circuits using built-in self-test (BIST) techniques is addressed. It is shown that, given a circuit with n primary inputs and the goal of maximizing expected pattern coverage, different pattern-sampling distributions for its 2/sup n/ possible patterns can be partially ordered. The exact distributions for pattern coverage for both equiprobable and nonequiprobable pattern-sampling distributions are derived. Approximations for pattern-coverage distributions under equiprobable pattern-sampling conditions and corresponding numerical results are presented. A limiting distribution function for pattern-coverage distribution is derived. The authors also present numerical results on confidence levels for obtaining a specified pattern coverage. The distribution for the number of test cycles (R) required to achieve a specified pattern coverage is also derived. The authors derive and use the expression for the expected value of R to illustrate the increase in the effect of achieving a specified coverage j as j increases. >
[1]
Dong Sam Ha,et al.
On using signature registers as pseudorandom pattern generators in built-in self-testing
,
1988,
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2]
Donald Ervin Knuth,et al.
The Art of Computer Programming
,
1968
.
[3]
D. E. Barton,et al.
Tables for the solution of the exponential equation, exp (-a)+ka= 1
,
1960
.
[4]
Solomon W. Golomb,et al.
Shift Register Sequences
,
1981
.
[5]
Andrzej Krasniewski,et al.
Circular self-test path: a low-cost BIST technique for VLSI circuits
,
1989,
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..