淡江大學機構典藏:Item 987654321/94523
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62797/95867 (66%)
造访人次 : 3734774      在线人数 : 398
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/94523


    题名: Power-aware multi-chains encoding scheme for low-cost environment
    其它题名: 低成本功率導向之多重鏈結串列式編碼方案
    作者: 吳柏翰;Wu, Po-Han
    贡献者: 淡江大學電機工程學系博士班
    饒建奇
    关键词: 測試壓縮;低功率測試資料壓縮;單晶片系統測試;Scan based testing;Low Power Testing;Test Data Compression;System-on-Chip (SoC);Design for Testability (DfT)
    日期: 2013
    上传时间: 2014-01-23 14:44:14 (UTC+8)
    摘要: 隨著測試資料不斷成長,測試成本也日益增加。為了降低測試成本,針對多重鏈結串列的測試架構下,本篇論文提出一個適用於大型電路的壓縮方式。此方法對於矽智財(Intellectual Property, IP)模組,或是單晶片系(System-On-a-Chip, SoC)都非常適用。同時考量在低成本的測試設備環境中,盡可能地降低電能轉換以及增加壓縮率。

    此壓縮架構基礎為固定長度的電能轉換紀錄方式,當測試資料的電能轉換頻率較低時,我們使用一個過濾器過濾不必要資料轉換,並保留目前的電能狀態,以降低電量的耗損。我們也提出一個新的演算法,可以重新配置多重鏈結串列結構,使其電能耗損率更低,壓縮結果更好。除此之外,本篇論文亦提出一個新的矩陣轉換方式,可以找出隱藏的資料相依關係。結果顯示本論文提出的方法,可同時降低電能轉換以及測試資料量。

    實驗結果顯示,當超大型積體電路的複雜度越益成長,測試所需的輸入腳位增加幅度卻非常低。針對ISCAS’89測試電路,使用MinTest或TetraMAX產生的測試資料,本論文提出的方法,平均壓縮率為63%。比對Selective Scan Slice (SSS)方法,對於MinTest測試資料,瞬間最大轉換電能減少3倍,平均電能轉換減少6.6倍;對於TetraMAX測試資料,瞬間最大電能轉換減少2.3倍,平均電能轉換減少5.6倍。平均硬體增加幅度為MinTest的6%及TetraMAX的6.5%。
    As test data volumes continue to grow, test costs also increase. To lower test costs, this paper presents a new compression method for testing large circuits, based on multiple scan-chains and an unknown structure. This method is targeted at intellectual property (IP) cores and system-on-a-chip (SoC) circuits. This study considers the shift-in power and compression ratio in low-cost ATE environments.

    This study presents a new compression architecture with fixed length for testing large circuits. Because power-aware test data are not changed frequently, a selector is used to filter the unnecessary status, and buffers are used to hold the back data. A new algorithm is proposed to assign multiple scan-chains. An improved linear dependency compute method is also proposed to determine the hidden dependency between scan-chains. Experimental results show that the proposed method can reduce both test data volume and shift-in power.

    The results showed that when the VLSI circuit grows in complexity, number of input pins required for testing increases slowly. The average compression ratio of the proposed method was 63% for MinTest and TetraMAX. On ISCASce for both tests, a value of 3x/6.6x was observed for MinTest and 2.3x/5.6x for TetraMAX, after comparing Selective Scan Slice (SSS) with the proposed method. The averages of hardware overhead costs were 6% for MinTest and 6.5% for TetraMAX.
    显示于类别:[電機工程學系暨研究所] 學位論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML258检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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