Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction
碩士 === 淡江大學 === 電機工程學系碩士在職專班 === 100 === One of IC tester’s problems is the larger and larger test data volume due to the complexity of the circuit design. Furthermore, since the unknown generated during the test procedure is taking a major part of the test data volume and space, it has become...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/54584867476921492583 |
id |
ndltd-TW-100TKU05442002 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-100TKU054420022016-04-04T04:17:01Z http://ndltd.ncl.edu.tw/handle/54584867476921492583 Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction 叢集式壓縮資料對未知向量之X填入法 Tsu-Hsiang Wei 魏子翔 碩士 淡江大學 電機工程學系碩士在職專班 100 One of IC tester’s problems is the larger and larger test data volume due to the complexity of the circuit design. Furthermore, since the unknown generated during the test procedure is taking a major part of the test data volume and space, it has become a waste of time and a burden, affecting rate of data compact. In this study, we combine clustering-approach with filling in X to substitute the unknown. By doing so, we solve the problem of the unknown and thus upgrade the compression rate. Take our case as an example, we first classify the clusters into groups and fill in a fixed number when cluster number equals 2. The outcome is a higher compression rate and no loss of data. 饒建奇 2012 學位論文 ; thesis 33 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 淡江大學 === 電機工程學系碩士在職專班 === 100 === One of IC tester’s problems is the larger and larger test data volume due to the complexity of the circuit design. Furthermore, since the unknown generated during the test procedure is taking a major part of the test data volume and space, it has become a waste of time and a burden, affecting rate of data compact.
In this study, we combine clustering-approach with filling in X to substitute the unknown. By doing so, we solve the problem of the unknown and thus upgrade the compression rate. Take our case as an example, we first classify the clusters into groups and fill in a fixed number when cluster number equals 2. The outcome is a higher compression rate and no loss of data.
|
author2 |
饒建奇 |
author_facet |
饒建奇 Tsu-Hsiang Wei 魏子翔 |
author |
Tsu-Hsiang Wei 魏子翔 |
spellingShingle |
Tsu-Hsiang Wei 魏子翔 Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction |
author_sort |
Tsu-Hsiang Wei |
title |
Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction |
title_short |
Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction |
title_full |
Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction |
title_fullStr |
Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction |
title_full_unstemmed |
Usage Cluster Analysis for Filling Methodology of Unknowns for Efficient Compaction |
title_sort |
usage cluster analysis for filling methodology of unknowns for efficient compaction |
publishDate |
2012 |
url |
http://ndltd.ncl.edu.tw/handle/54584867476921492583 |
work_keys_str_mv |
AT tsuhsiangwei usageclusteranalysisforfillingmethodologyofunknownsforefficientcompaction AT wèizixiáng usageclusteranalysisforfillingmethodologyofunknownsforefficientcompaction AT tsuhsiangwei cóngjíshìyāsuōzīliàoduìwèizhīxiàngliàngzhīxtiánrùfǎ AT wèizixiáng cóngjíshìyāsuōzīliàoduìwèizhīxiàngliàngzhīxtiánrùfǎ |
_version_ |
1718214702509588480 |