簡易檢索 / 詳目顯示

研究生: 楊凱筌
Kai-Chuan Yang
論文名稱: 利用自動限制生成以考慮複雜佈局規則之網狀式堆疊導通孔設計
Meshed Stack Via Design Considering Complicated Design Rules with Automatic Constraint Generation
指導教授: 方劭云
Shao-Yun Fang
口試委員: 劉一宇
Yi-Yu Liu
呂學坤
Shyue-Kung Lu
李毅郎
Yih-Lang Li
學位類別: 碩士
Master
系所名稱: 電資學院 - 電機工程系
Department of Electrical Engineering
論文出版年: 2020
畢業學年度: 108
語文別: 英文
論文頁數: 52
中文關鍵詞: 網狀式堆疊導通孔設計複雜佈局規則自動限制生成
外文關鍵詞: Meshed Stack Via Design, Complex Design Rule, Automatic Constraint Generation
相關次數: 點閱:258下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

在先進半導體製程中,佈局特徵的急劇縮小對電路延遲和電子遷移(EM)現象產生了重大影響。近來,網狀式堆導通孔(MSV)被提出作為改善電路時序和信號完整性的解決方案,每個MSV都是由平行金屬線和導通孔組成的多層網狀結構。 由於引入了MSV設計規則以及越來越複雜的佈局規則,MSV設計成為一個非常具有挑戰性的問題,而以前的研究都沒有解決這個問題。在本文中,我們是目前第一篇提出MSV設計的研究,並且有兩種設計方法:基於整數線性規劃(ILP)的方法和基於動態規劃(DP)的方法。 與大多數以前致力於為每個複雜的佈局規則制定約束的工作不同,我們提出了一種自動限制生成(ACG)架構來迭代解決佈局規則違規(DRV),而無需費力地理解所有佈局規則,從而為MSV設計做出了貢獻,並且可適用於不同的技術節點。實驗結果表明,對於業界測資,基於ILP的方法和基於DP的方法平均可以實現92%的MSV插入率。 此外,通過採用本篇提出的ACG架構搭配前面兩個方法,皆可以實現100%MSV插入率,而不會引起任何DRV。


In advanced semiconductor processes, the dramatic shrink of layout features has made a significant impact on circuit delay and electromigration (EM). Recently, meshed stack vias (MSVs) have been proposed as a solution to improve circuit timing and signal integrity, each of which is a multi-layer mesh structure composed of parallel metal shapes and vias. Due to the introduced MSV rules and more and more complicated design rules, MSV design becomes a very challenging problem, while no previous work has addressed this issue.
In this thesis, we propose the first work of MSV design by developing two different methods: an integer linear programming (ILP)-based and a dynamic programming (DP)-based methods.
Unlike most previous works devoting themselves to formulating sophisticated constraints for each complicated design rule, we propose an automatic constraint generation (ACG) framework to iteratively resolve design rule violations (DRVs) without any effort in understanding all design rules, which contributes to a general MSV design methodology applicable to different technology nodes.
Experimental results show that both the ILP-based and DP-based approaches can averagely achieve 92% MSV insertion rate for a set of industrial benchmarks. In addition, by adopting the proposed ACG framework, 100% MSV insertion rate can be achieved without causing any DRV.

Abstract vii List of Tables xi List of Figures xii Chapter 1. Introduction 1 1.1 Meshed Stack Via . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Challenge . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Previous Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.5 Thesis Organization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Chapter 2. MSV Rules and Problem Formulation 7 2.1 MSV Speci cation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Chapter 3. Integer Linear Programming (ILP)-based MSV Design 10 3.1 ILP Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 M1 Pin Extension Handling . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3 ILP Objective Function . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.4 Trivial Design Rule Handling . . . . . . . . . . . . . . . . . . . . . . . . 16 3.4.1 Spacing Rule between Metal Shapes . . . . . . . . . . . . . . . . . 16 3.4.2 Spacing Rule between Via Cuts . . . . . . . . . . . . . . . . . . . . 17 3.4.3 Obstacle-aware Spacing Rule . . . . . . . . . . . . . . . . . . . . . 18 Chapter 4. Dynamic Programming (DP)-based MSV Design 19 4.1 Graph Optimization Problem of MSV . . . . . . . . . . . . . . . . . . . . 19 4.2 Other MSV Rules and Design Rules Handling . . . . . . . . . . . . . . . 24 Chapter 5. Automatic Constraint Generation (ACG) Framework 25 Chapter 6. Experimental Results 28 Chapter 7. Conclusion 35 Bibliography 36 Publication List 39

[1] IBM ILOG CPLEX Optimizer. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer/
[2] L. C. Lu, "Physical Design Challenges and Innovations to Meet Power, Speed, and Area Scaling Trend," in Proceedings of International Symposium of Physical Design, pp. 63-63, 2017.
[3] Y. Zhong, T.C. Yu, K.C. Yang, S.Y. Fang, "Via Pillar-aware Detailed Placement,"
in Proceedings of International Symposium of Physical Design, pp. 17-24, 2020.
[4] W. H. Liu, S. Mantik, W. K. Chow, Y. Ding, A. Farshidi and G. Posser, "ISPD 2019 Initial Detailed Routing Contest and Benchmark with Advanced Routing Rules," in Proceedings of International Symposium of Physical Design, pp. 147-151, 2019.
[5] F. K. Sun, H. Chen, C.Y. Chen, C.H. Hsu and Y.W. Chang, "A Multithreaded Initial Detailed Routing Algorithm Considering Global Routing Guides," in Proceedings of International Conference on Computer-Aided Design, pp. 1-7, 2018.
[6] G. Chen, C.W. Pui, H. Li, J. Chen, B. Jiang and E. F. Young, "Detailed Routing by Sparse Grid Graph and Minimum-Area-Captured Path Search," in Proceedings of Asia and South Paci c Design Automation Conference, pp. 754-760, 2019.
[7] M. Ahrens, M. Gester, N. Klewinghaus, D. Muller, S. Peyer, C. Schulte, and G. Tellez, "Detailed routing algorithms for advanced technology nodes," IEEE Transactions on Computer-Aided Design and Integrated Circuits Systems, vol. 34, no. 4, pp. 563-576, 2015.
[8] K. Han, A. Kahng, and H. KhooAn, "Evaluation of BEOL Design Rule Impacts Using An Optimal ILP-based Detailed Router," in Proceedings of Design Automation Conference, pp. 1-6, 2015.
[9] X. Jia, Y. Cai, Q. Zhou, and B. Yu, "A Multicommodity Flow-Based Detailed Router With Ecient Acceleration Techniques," IEEE Transactions on Computer-Aided Design and Integrated Circuits Systems, vol. 37, no. 1, pp. 217-230, 2017.
[10] X. Jia, Y. Cai, Q. Zhou, G. Chen, Z. Li and Z. Li "MCFRoute: A Detailed Router Based on Multi-Commodity Flow Method," in Proceedings of International Conference on Computer-Aided Design, pp. 397-404, 2014.
[11] I. Kang, C. Han, D. Park and C.K. Cheng "Fast and Precise Routability analysis with Conditional Design Rules," in Proceedings of International Workshop on System Level Interconnect Prediction, pp. 4, 2018.
[12] H. Li, G. Chen, B. Jiang, J. Chen and E. F. Young, "Dr. CU 2.0: A Scalable Detailed Routing Framework with Correct-by-Construction Design Rule Satisfaction," in IEEE/ACM International Conference on Computer-Aided Design, pp. 1-7, 2019.
[13] Y. Zhang and C. Chu, "RegularRoute: An ecient detailed router applying regular routing patterns," in IEEE transactions on very large scale integration (VLSI) systems, pp. 1655-1668, 2012.

無法下載圖示 全文公開日期 2025/07/14 (校內網路)
全文公開日期 本全文未授權公開 (校外網路)
全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
QR CODE