| Enhancing error resilience for reliable compression of VLSI test data |
| Full text |
Pdf
(123 KB)
|
| Source
|
Great Lakes Symposium on VLSI
archive
Proceedings of the 15th ACM Great Lakes symposium on VLSI
table of contents
Chicago, Illinois, USA
POSTER SESSION: Poster session 2
table of contents
Pages: 371 - 376
Year of Publication: 2005
ISBN:1-59593-057-4
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 0
|
|
|
ABSTRACT
This paper presents a novel methodology to improve error resilience for reliable compression of test data of VLSI circuits. The presence of so-called "bit-flips" (due to the high speed manufacturing test or noise in the Automatic Test Equipment (ATE) head) can lead to a significant loss in coverage when compression is employed. As reported in the technical literature, coverage can experience a reduction of as much as 30% due to bit-flips in the compressed sequence of the test data. Differently from reported works, the proposed technique adds a very small amount of redundant information to test data prior to its compression; the objective of the redundant data is to limit the so-called "propagation" effect due to bit-flips once the sequence is decompressed. Extensive simulation results are presented to substantiate the increase in error resilience and to evaluate the impact of the redundancy introduced by the proposed approach on the compression ratio. It is shown that for the ISCAS89 benchmark circuits the reduction in coverage is only 0.20%-3.52% which is significantly better than previously reported works.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
A. Chandra and K. Chakrabarty, "System-on-a-Chip Test-Data Compression and Decompression Architectures Based on Golomb Codes," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 20, No. 3, pp. 355--368, March 2001.
|
| |
4
|
|
| |
5
|
V. Iyengar, K. Chakrabarty, and B. T. Murray, "Huffman Encoding of Test Sets for Sequential Circuits," IEEE Trans. on Instrumentation and Measurement, Vol. 47, No. 1, pp. 21--25, Feb. 1998.
|
| |
6
|
P. T. Gonciari, B. M. Al-Hashimi, and N. Nicolici "Variable-Length Input Huffman Coding for System-on-a-Chip Test," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 22, No. 6, pp. 783--796, June 2003.
|
| |
7
|
A. Jas, J. G. Dastidar, N. M. Eng, and N. A. Touba, "An Efficient Test Vector Compression Scheme Using Selective Huffman Coding," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 22, No. 6, pp. 797--806, June 2003.
|
| |
8
|
|
| |
9
|
B. P. Tunstall, "Synthesis of Noiseless Compression Codes," Ph. D. thesis, Georgia Institute of Technology, 1967.
|
| |
10
|
|
| |
11
|
B. West, "Private Communication," NPTest.
|
 |
12
|
|
| |
13
|
K. Helsgaun, "An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic," European Journal of Operational Research, Vol. 126, No. 1, pp. 106--130, 2000.
|
|