1/20 A Novel Technique for Input Vector Compression in System-on-Chip Testing Student: Chien Nan Lin Satyendra Biswas, Sunil Das, and Altaf Hossain,” Information Technology, ICIT '08. International Conference on ”, Bhubaneswar, pp , Dec

2/24 Outline Introduction Frame of Compression Technique Theoretical Background Proposed Technique Experimental Results

3/24 Introduction In this paper, a new test vector compression method for VLSI circuit testing is presented. To reduce the on-chip: Storage area Testing time Simulation experiments on ISCAS 85 benchmark.

4/24 Introduction

5/24 Outline Introduction Frame of Compression Technique Theoretical Background Proposed Technique Experimental Results

6/24 Frame of Compression Technique Original Test Vectors Block Matching Lzw Coding Compressed Test Vectors Low Frequency Data Sets High Frequency Data Sets Burrows-Wheeler Transformation +

7/24 Output Outline Introduction Frame of Compression Technique Theoretical Background Proposed Technique Experimental Results

8/24 Theoretical Background Original Test Vectors Block Matching Lzw Coding Compressed Test Vectors Low Frequency Data Sets High Frequency Data Sets Burrows-Wheeler Transformation + Frame

9/24 Theoretical Background Burrows-Wheeler Transform The Burrows-Wheeler transformation algorithm is described in the following: Step 1:Create a list of possible rotation of string. Step 2:Let each rotation be one row in a large, sequare table. Step 3:Sort the rows of the alphabetically, treating each row as a string. Step 4:Return the last column of the table.

10/24 Theoretical Background Burrows Wheeler Transform

11/24 Theoretical Background Burrows-Wheeler Transform For example: Input All Rotations Sort the Rows ^ BANANA (the character indicates the 'EOF' pointer)EOF

12/24 Theoretical Background Burrows-Wheeler Transform Compressing test data using run-length coding and Burrows-Wheeler transformation. For example: ─> AAABBBBBBBBBAA ─> 3A9B2A A is 「 Run 」 3 is 「 Length 」

13/24 Theoretical Background Burrows-Wheeler Transform Reversing the example above is done like this:

14/24 Reversing the example above is done like this:

15/24 Theoretical Background Lzw Coding

16/24 Theoretical Background The initial dictionary # = = 0 A = = 1 B = C = Z = = 26 Example: TOBEORNOTTOBEORTO BEORNOT# Lzw Coding

17/24 Theoretical Background Encoding

18/24 Output Outline Introduction Frame of Compression Technique Theoretical Background Proposed Technique Experimental Results

19/24 Frame Original Test Vectors Block Matching Lzw Coding Compressed Test Vectors Low Frequency Data Sets High Frequency Data Sets Burrows-Wheeler Transformation +

20/24 All the test vectors are divided into several block of equal size. Proposed Technique BlOCK Number Test Vector Test Vector Test Vector

21/24 Proposed Technique T K,where K=1,2,3,…,n, as a matrix of M N, M > 2, N= block size of data.

22/24 Output Outline Introduction Frame of Compression Technique Theoretical Background Proposed Technique Experimental Results

23/24 Experimental Results

24/24 Experimental Results

25/24 Thanks