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.
Chapter 3<br />
Proposed Compression Algorithms<br />
3.1 Introduction<br />
In this work we propose a test data compression technique that utilizes a multiple<br />
scan chains configuration. This configuration is shown in Figure 3.1(a). The input<br />
test set consists <strong>of</strong> n V scan test vectors, each vector configured into N scan chains <strong>of</strong><br />
length L each. The output <strong>of</strong> the compression algorithm is shown in Figure 3.1(b).<br />
It contains n V ′ test vectors, where n V ′ ≥ n V , each encoded using M representative<br />
scan chains <strong>of</strong> length L. These vectors, called representative vectors, are grouped<br />
into n P partitions. Figure 3.2 shows the block diagram <strong>of</strong> the hardware <strong>and</strong> CUT,<br />
where M is the number <strong>of</strong> ATE scan input channels <strong>and</strong> N denotes the number<br />
<strong>of</strong> scan chains internal to the core feeding the scan cells. In this configuration,<br />
N ≫ M, i.e., the compressed input test data is composed <strong>of</strong> a much smaller number<br />
26