Optimal Scheduling of Signature Analysis for VLSI Testing

A simple algorithm that shows how to optimally schedule the test-application and the signature-analysis phases of VLSI testing is presented. The testing process is broken into subintervals, the signature is analyzed at the end of each subinterval, and future tests are aborted if the circuit is found to be faulty, thus saving test time. The mathematical proofs associated with the algorithm are given. >

[1]  L.M. Huisman.  The reliability of approximate testability measures , 1988, IEEE Design & Test of Computers.

[2]  Edward J. McCluskey,et al.  Probability models for pseudorandom test sequences , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[4]  Dilip K. Bhavsar,et al.  Can We Eliminate Fault Escape in Self-Testing by Polynomial Division (Signature Analysis) ? , 1984, ITC.

[5]  James E. Smith,et al.  Measures of the Effectiveness of Fault Signature Analysis , 1980, IEEE Transactions on Computers.

[6]  René David,et al.  Testing by Feedback Shift Register , 1980, IEEE Transactions on Computers.

[7]  M. Gruetzner,et al.  Aliasing Errors in Signature in Analysis Registers , 1987, IEEE Design & Test of Computers.

[8]  J. A. Waicukauski.  Diagnosis of BIST Failures by PPSFP simulation , 1987 .

[9]  John E. Bauer,et al.  An Advanced Fault Isolation System for Digital Logic , 1975, IEEE Transactions on Computers.