Signal probability-based test cube reordering and merging
A first score and a second score for each scan cell are first determined based on numbers of test cubes in a set of test cubes having a specified value of “1” and a specified value of “0” for the each scan cell, respectively. A ranking score for each test cube in the set of test cubes is then determined based on combining the first scores and the second scores corresponding to specified bits of the each test cube in the set of test cubes. Test cubes in the set of test cubes are merged according to a sequence based on the ranking scores in a test pattern generation process.
1. A method, executed by at least one processor of a computer, comprising:
determining a first score and a second score for each scan cell based on numbers of test cubes in a set of test cubes having a specified value of “1” and a specified value of “0” for the each scan cell, respectively;
determining a ranking score for each test cube in the set of test cubes based on combining the first scores and the second scores corresponding to specified bits of the each test cube in the set of test cubes; and
generating test patterns, comprising: merging test cubes in the set of test cubes according to a sequence based on the ranking scores.
2. The method recited in claim 1 , wherein the first score and the second score are a reciprocal of the number of test cubes in the set of test cubes having a specified value of “1” for the each scan cell and a reciprocal of the number of test cubes in the set of test cubes having a specified value of “0” for the each scan cell, respectively.
3. The method recited in claim 1 , wherein the ranking score is a sum of the first scores and the second scores corresponding to the specified bits which is normalized by a number of the specified bits.
4. The method recited in claim 1 , wherein the merging test cubes comprises:
ranking the set of test cubes according to the ranking scores;
merging as many test cubes in the set of test cubes as possible based on the ranking to identify first test cubes and second test cubes, the first test cubes being test cubes that can be merged, and the second test cubes being test cubes that cannot be merged;
ranking the first test cubes based on new ranking scores for the first test cubes, the new ranking scores determined based on the first scores and the second scores determined using the first test cubes; and
performing incremental merging and compression checking on the ranked first test cubes to produce a merged test cube.
5. The method recited in claim 4 , wherein the merging test cubes further comprises:
merging as many second test cubes into the merged test cube as possible to produce a final merged test cube, the final merged test cube passing the compression checking.
6. The method recited in claim 4 , wherein the compression checking is EDT encoding checking.
7. One or more non-transitory computer-readable media storing computer-executable instructions for causing one or more processors to perform a method, the method comprising:
determining a first score and a second score for each scan cell based on numbers of test cubes in a set of test cubes having a specified value of “1” and a specified value of “0” for the each scan cell, respectively;
determining a ranking score for each test cube in the set of test cubes based on combining the first scores and the second scores corresponding to specified bits of the each test cube in the set of test cubes; and
generating test patterns, comprising: merging test cubes in the set of test cubes according to a sequence based on the ranking scores.
8. The one or more non-transitory computer-readable media recited in claim 7 , wherein the first score and the second score are a reciprocal of the number of test cubes in the set of test cubes having a specified value of “1” for the each scan cell and a reciprocal of the number of test cubes in the set of test cubes having a specified value of “0” for the each scan cell, respectively.
9. The one or more non-transitory computer-readable media recited in claim 7 , wherein the ranking score is a sum of the first scores and the second scores corresponding to the specified bits which is normalized by a number of the specified bits.
10. The one or more non-transitory computer-readable media recited in claim 7 , wherein the merging test cubes comprises:
ranking the set of test cubes according to the ranking scores;
merging as many test cubes in the set of test cubes as possible based on the ranking to identify first test cubes and second test cubes, the first test cubes being test cubes that can be merged, and the second test cubes being test cubes that cannot be merged;
ranking the first test cubes based on new ranking scores for the first test cubes, the new ranking scores determined based on the first scores and the second scores determined using the first test cubes; and
performing incremental merging and compression checking on the ranked first test cubes to produce a merged test cube.
11. The one or more non-transitory computer-readable media recited in claim 10 , wherein the merging test cubes further comprises:
merging as many second test cubes into the merged test cube as possible to produce a final merged test cube, the final merged test cube passing the compression checking.
12. The one or more non-transitory computer-readable media recited in claim 10 , wherein the compression checking is EDT encoding checking.