The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1991 vol.40)
pp: 336-341
ABSTRACT
<p>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.</p>
INDEX TERMS
optimal scheduling; signature analysis; VLSI testing; test-application; subintervals; mathematical proofs; integrated circuit testing; logic testing; scheduling; VLSI.
CITATION
Y.-H. Lee, C.M. Krishna, "Optimal Scheduling of Signature Analysis for VLSI Testing", IEEE Transactions on Computers, vol.40, no. 3, pp. 336-341, March 1991, doi:10.1109/12.76412
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool