TY - GEN
T1 - Optimal scheduling of signature analysis for VLSI testing
AU - Lee, Y. H.
AU - Krishna, C. M.
PY - 1988/12/1
Y1 - 1988/12/1
N2 - A simple algorithm is presented which minimizes the mean testing time for VLSI circuits. By breaking up the testing process into subintervals, and analyzing the signature at the end of each subinterval, it is possible to abort future tests if the circuit is found to be faulty, thus saving test time. Subdivision of the test process also reduces the probability of aliasing, thus increasing the effective coverage of the signature analysis process. Also, if the process is sufficiently subdivided, it may be possible to use the test results not only to determine if the circuit is faulty or not, but to diagnose the fault.
AB - A simple algorithm is presented which minimizes the mean testing time for VLSI circuits. By breaking up the testing process into subintervals, and analyzing the signature at the end of each subinterval, it is possible to abort future tests if the circuit is found to be faulty, thus saving test time. Subdivision of the test process also reduces the probability of aliasing, thus increasing the effective coverage of the signature analysis process. Also, if the process is sufficiently subdivided, it may be possible to use the test results not only to determine if the circuit is faulty or not, but to diagnose the fault.
UR - http://www.scopus.com/inward/record.url?scp=0024121730&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024121730&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0024121730
SN - 0818608706
T3 - Digest of Papers - International Test Conference
SP - 443
EP - 451
BT - Digest of Papers - International Test Conference
PB - Publ by IEEE
ER -