English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49258/83791 (59%)
Visitors : 7141611      Online Users : 84
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/77474


    Title: 叢集式壓縮資料對未知向量之X填入法
    Other Titles: Usage cluster analysis for filling methodology of unknowns for efficient compaction
    Authors: 魏子翔;Wei, Tsu-Hsiang
    Contributors: 淡江大學電機工程學系碩士在職專班
    饒建奇;Rau, Jiann-chyi
    Keywords: 壓縮資料;叢集;X-fill;ATE Vector;Compression;Cluster
    Date: 2012
    Issue Date: 2012-06-21 06:48:28 (UTC+8)
    Abstract: 在現今的IC測試領域中,因為電路設計的複雜度越來越高,使得測試資料與日俱增,而在測試資料當中,未知向量又會占去大部分的測試容量及空間,不但浪費時間,佔去測試時的資料空間,更進一步影響資料壓縮率,造成測試者的負擔。
    本文章內容,是利用叢集式壓縮法,在未知向量上,加上X填入法,使得整個壓縮率得以提升,解決一般測試者對未知向量的困擾,我們將叢集式壓縮法先做Group的分類,再以Cluster Number =2的情況下,對未知向量做固定值的填入(遮罩),如此得以改善壓縮率,也因未知向量視為固定值,減少了壓縮資料失真的問題。
    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.
    Appears in Collections:[電機工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML78View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback