Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電子工程學研究所
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/68349
Title: 基於錯誤效應驅動決策樹以提高自動測試圖樣生成演算法之效能以及其實作範例
D-Drive History Tree to Enhance ATPG Efficiency and its Implementation Examples
Authors: Ching-Yuan Chen
陳敬元
Advisor: 黃俊郎(Jiun-Lang Huang)
Keyword: 決策樹,錯誤驅動,回溯修正,測試壓縮,路徑導向決策演算法,自動化測試圖樣產生,
decision tree,D-drive,backtrack,test compaction,PODEM,test pattern generation,
Publication Year : 2017
Degree: 碩士
Abstract: 西元一九六六年,自動化測試圖樣產生演算法的始祖—錯誤效應演算法(D-Algorithm)首次發表。自此,大量的研究成果隨之而來,並在演算法加速以及產生圖樣品質上取得巨大的成果。即便如此,在演算法加速以及測試品質上仍存有許多進步空間 。
我們提出錯誤效應驅動決策樹以取代傳統算法中的決策樹。其紀錄每一次錯誤驅動(D-drive)程序中候選以及選中以傳遞錯誤效應之邏輯閘。該決策樹有助於減少測試圖樣產生過程中衍生多餘的邏輯值指定(Redundant Signal Assignment),並提供更精細錯誤驅動策略的可能性。這意味著更好的算法加速以及測試圖樣品質。於本論文中,我們提供兩個基於錯誤效應驅動決策樹的實作範例—深度優先 (DF-PODEM)以及錯誤效應傳播最大化之路徑導向決策演算法(PM-PODEM)。前者達到最高32%之演算法加速,而後者達到最高11%之測試圖樣壓縮率。根據實驗結果,兩個測試圖樣產生演算法皆提供更好的算法加速、測試涵蓋率(Test Coverage)、以及測試圖樣壓縮率。
值得注意的是,錯誤效應驅動決策樹相當易於整合至現有各式自動化測試圖樣系統,同時也易於擴展以達到更好的算法加速以及針對各式品質指標的測試圖樣品質優化。
Since the first publication of D-algorithm (DALG) in 1966, lots of following works on automatic test pattern generation (ATPG) algorithm have been proposed to achieve higher speed-up and quality of generated test set. Though big progress has been made through decades, it still has lots of room for improvement in speed-up and generated test quality of ATPG.
In this thesis, we propose D-drive History Tree (D-Tree) to replace the assignment decision tree in the conventional ATPG, which keeping track of all the candidates and the chosen gate(s) to propagate fault effect for each D-drive process. This D-tree helps eliminate the possibility of producing redundant signal assignments (RSAs) and makes more sophistical D-drive strategies possible, thus enhance the ATPG efficiency and/or the test quality. Two implementation examples based on PODEM algorithm—Depth-First PODEM (DF-PODEM) and Propagation Maximization PODEM (PM-PODEM) are proposed to show its power to immediate boost both performance and/or pattern quality of ATPG. DF-PODEM turns out to achieve up to 32% speed-up, along with higher fault coverage and/or compacted test length, on ISCAS'89 and ITC'99 benchmark circuits. PM-PODEM achieve up to 11% shorter test length, along with higher fault coverage and/or lower run-time, on the same set of circuits under test (CUT).
Also, as to be shown, D-tree could not only easily be integrated with pre-existed ATPG-improving strategies, but also quite flexible thus could easily be extended to gain even higher speed-up and higher quality specifically for different quality metrics.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/68349
DOI: 10.6342/NTU201704159
Fulltext Rights: 有償授權
Appears in Collections:電子工程學研究所

Files in This Item:
File SizeFormat 
ntu-106-1.pdf
  Restricted Access
1.85 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved