Dynamic probe scheduling optimization for MCM substrate test

Abstract

We propose an improved integrated test generation/optimization algorithm for Multichip Module (MCM) substrate verification using two-probe testers. The goal of this work is to reduce the substrate testing time while providing complete coverage for open, short, and high net resistance faults. We approach this objective via two directions, namely test set size reduction and efficient probe scheduling. The test set size reduction is achieved by eliminating redundant tests associated with conventional approaches. The probe scheduling problem is formulated as a dynamical multi-dimensional Traveling Salesman Problem for probe sequence optimization. A simulated annealing based algorithm is devised to simultaneously take these two factors into consideration during the integrated test generation/optimization process. Since there exist numerous test sets providing complete fault coverage for a given design, our algorithm dynamically selects preferred ones by invoking an efficient validation routine during the test generation/optimization. Experiments conducted on industrial substrates using a two-probe tester showed that the test sets generated by our algorithm are able to reduce the testing time by over 38% compared to those generated by an in-house patented package.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>