黃鐘揚Huang, Chung-Yang臺灣大學:電機工程學研究所粘敬佳Nien, Chin-ChiaChin-ChiaNien2010-07-012018-07-062010-07-012018-07-062009U0001-2007200920092200http://ntur.lib.ntu.edu.tw//handle/246246/188089在本論文中，我們提出了一個考慮多重邊界與操作模式之靜態時序分析引擎。它能在不同的大電路中有效率地計算出許多製程邊界中最大的延遲。我們關鍵的貢獻在於：(一)路徑模式與參數模式的縝密結合，使得此引擎在不同的電路下都是很健全的。(二)增強的搜尋空間刪除技巧。(三)簡易而有效率地計算出關鍵路徑延遲界限，大大地加強了起始搜尋空間刪除的能力。(四)延伸到保持時間的確認。我們的實驗結果顯示出在不同參數數量與不同電路下，我們的引擎都比以往的考慮多重編界與操作模式之靜態時序分析方法還要傑出。In this thesis, we proposed a unified Multi-Corner Multi-Mode (MCMM) static timing analysis (STA) engine that can efficiently compute the worst-case delay of the process corners in various very large scaled circuits. Our key contributions include: (1) a seamless integration of the path- and parameter-based branch-and-bound algorithms so that the engine is very robust for different kinds of circuits, (2) an improved search space pruning technique, (3) a simple yet efficient critical path delay bound for the initial search space pruning, and (4) an extension to the hold-time check. Our experimental results show that our engine can significantly outperform the prior MCMM STA approaches in various benchmark circuits with different number of process parameters.誌謝 I要 IIbstract IIIable of Contents IVist of Figures VIIist of Tables VIIIhapter 1 Introduction 1.1 Static Timing Analysis 1.2 Taxonomy of the Process Variations 3.3 Variation-Aware Static Timing Analysis 4.4 Statistical Static Timing Analysis 5.5 Multi-Corner Multi-Mode Static Timing Analysis 5.6 Linear-Time Approximation Approach for MCMM STA 6.7 Exact Delay Upper-Bound Computation Approach for MCMM STA 7.8 Contributions of this Thesis 7hapter 2 Previous Works on MCMM STA 9.1 Linear Modeling of Process Variations 10.2 Approximate MCMM STA 12.3 Exact MCMM STA 15hapter 3 MCMM STA Algorithms 18.1 Linear Time Approximation Approach 18.2 Exhaustive Method for the MCMM Timing Analysis 22.3 Dynamic Pruning Method in Exact MCMM STA Algorithms 24hapter 4 The Unified MCMM STA Engine 26.1 Overview of the Unified Engine 26.2 Improved Path-Based BNB 29.3 Improved Parameter-Based BNB 30.4 Candidate Critical Path Delay for Initial Search Space Pruning 34.5 Extension to Hold Time Check 35hapter 5 Implementation 36.1 Data Structure 36.2 Input Format 38hapter 6 Experimental Results 40.1 Improved Path-Based BNB 41.2 Improved Parameter-Based BNB 42.3 Robustness of Our Unified Engine 43.4 The Range of Process Variation 44.5 Extension to Hold Time Check 45hapter 7 Conclusions 46eference 47262048 bytesapplication/pdfen-US考量變動的靜態時序分析多重邊界與操作模式分枝與跳躍仿射函數製程變動variation-aware timing analysismulti-corner multi-modebranch-and-boundaffine functionprocess variationsthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/188089/1/ntu-98-R95921029-1.pdf