Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
A Variable-Length Coding Adjustable for Compressed Test Application Hideyuki ICHIHARA Toshihiro OHARA Michihiro SHINTANI Tomoo INOUE Publication IEICE TRANSACTIONS on Information and Systems Vol.E90-D No.8 pp.1235-1242 Publication Date: 2007/08/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e90-d.8.1235 Print ISSN: 0916-8532 Type of Manuscript: PAPER Category: Dependable Computing Keyword: test compression, variable-length coding, test application time, ATE, Huffman code, and test environment, Full Text: PDF(309.9KB)>>
Summary: Test compression / decompression using variable-length coding is an efficient method for reducing the test application cost, i.e., test application time and the size of the storage of an LSI tester. However, some coding techniques impose slow test application, and consequently a large test application time is required despite the high compression. In this paper, we clarify the fact that test application time depends on the compression ratio and the length of codewords and then propose a new Huffman-based coding method for achieving small test application time in a given test environment. The proposed coding method adjusts both of the compression ratio and the minimum length of the codewords to the test environment. Experimental results show that the proposed method can achieve small test application time while keeping high compression ratio. | ||||||||||
| ||||||||||
