Text - KFUPM - King Fahd University of Petroleum and Minerals
Text - KFUPM - King Fahd University of Petroleum and Minerals
Text - KFUPM - King Fahd University of Petroleum and Minerals
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Vector SC 1<br />
SC 2<br />
SC 3<br />
SC 4<br />
3<br />
0<br />
0<br />
0<br />
1<br />
X<br />
0<br />
X<br />
1<br />
1<br />
X<br />
0<br />
1<br />
3a<br />
3b<br />
0<br />
X<br />
0<br />
X<br />
0<br />
X<br />
Figure 3.9: Decomposition <strong>of</strong> vector 3 into two vectors 3a <strong>and</strong> 3b<br />
X<br />
X<br />
0<br />
1<br />
X<br />
X<br />
X<br />
1<br />
1<br />
X<br />
X<br />
1<br />
X<br />
X<br />
1<br />
X<br />
0<br />
1<br />
this vector is decomposed into two vectors 3a <strong>and</strong> 3b as shown in Figure 3.9, each<br />
detecting only a subset <strong>of</strong> faults detected by the original vector. The compatibility<br />
graphs <strong>of</strong> these vectors are shown in Figures 3.10 <strong>and</strong> 3.11. The decomposed vectors<br />
satisfy the threshold. Now these decomposed vectors can be merged with the existing<br />
partitions or new partitions can be created if required.<br />
SC1<br />
SC 2<br />
SC3<br />
SC 4<br />
Figure 3.10: Conflict graph for vector 3a<br />
3.5 Proposed Compression Algorithms<br />
The objective <strong>of</strong> the proposed algorithm is to compress the test test using M tester<br />
channels while minimizing the increase in test size (due to decomposition) <strong>and</strong> to-<br />
37