Slice Test Data Compression
碩士 === 元智大學 === 資訊工程學系 === 100 === In traditional testing research for testing VLSI circuits, the larger and larger amounts of test data volume increasing the test time and test cost very much. In this thesis, we proposed an effective compression method to reduce large amounts of test data volume fo...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/20842753744074826514 |
id |
ndltd-TW-100YZU05392038 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100YZU053920382015-10-13T21:33:10Z http://ndltd.ncl.edu.tw/handle/20842753744074826514 Slice Test Data Compression 切片式測試資料壓縮 林宜民 碩士 元智大學 資訊工程學系 100 In traditional testing research for testing VLSI circuits, the larger and larger amounts of test data volume increasing the test time and test cost very much. In this thesis, we proposed an effective compression method to reduce large amounts of test data volume for multiple-scan testing. Different from other compression methods using multiple scan chains, in this method, we not only deal with each slice but also combine the run-length-based technique. There is no need to change the internal structure of CUT, nor do we use a particular algorithm. We use the some traits in each slice like the repeated data between each slice or the repeated data in each slice or specific bits in each slice. Our codeword is quite different. The length of each codeword is not fixed. We will decide the length of each codeword by different traits in each slice. Our hardware structure is simple, only a buffer, a decoder and several counters are needed. We use ISCAS-89 benchmark circuits in our experiment. We can see the experiment results show that our method is especially effective as the circuit size grows. 曾王道 學位論文 ; thesis 28 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 資訊工程學系 === 100 === In traditional testing research for testing VLSI circuits, the larger and larger amounts of test data volume increasing the test time and test cost very much. In this thesis, we proposed an effective compression method to reduce large amounts of test data volume for multiple-scan testing. Different from other compression methods using multiple scan chains, in this method, we not only deal with each slice but also combine the run-length-based technique. There is no need to change the internal structure of CUT, nor do we use a particular algorithm. We use the some traits in each slice like the repeated data between each slice or the repeated data in each slice or specific bits in each slice. Our codeword is quite different. The length of each codeword is not fixed. We will decide the length of each codeword by different traits in each slice. Our hardware structure is simple, only a buffer, a decoder and several counters are needed. We use ISCAS-89 benchmark circuits in our experiment. We can see the experiment results show that our method is especially effective as the circuit size grows.
|
author2 |
曾王道 |
author_facet |
曾王道 林宜民 |
author |
林宜民 |
spellingShingle |
林宜民 Slice Test Data Compression |
author_sort |
林宜民 |
title |
Slice Test Data Compression |
title_short |
Slice Test Data Compression |
title_full |
Slice Test Data Compression |
title_fullStr |
Slice Test Data Compression |
title_full_unstemmed |
Slice Test Data Compression |
title_sort |
slice test data compression |
url |
http://ndltd.ncl.edu.tw/handle/20842753744074826514 |
work_keys_str_mv |
AT línyímín slicetestdatacompression AT línyímín qièpiànshìcèshìzīliàoyāsuō |
_version_ |
1718066287694839808 |