簡易檢索 / 詳目顯示

研究生: 潘麒安
Chi-An Pan
論文名稱: 基於整數線性規劃之細間距球柵陣列封裝基板繞線架構
Integer Linear Programming Based Substrate Routing Framework for Fine Pitch Ball Grid Array Package
指導教授: 劉一宇
Yi-Yu Liu
口試委員: 吳坤熹
Kun-Hsi Wu
方劭云
Shao-Yun Fang
謝仁偉
Jen-Wei Hsieh
陳勇志
Yung-Chih Chen
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2019
畢業學年度: 107
語文別: 英文
論文頁數: 43
中文關鍵詞: 封裝細間距球柵陣列基板繞線整數線性規劃
外文關鍵詞: Packaging, FBGA, Substrate Routing, ILP
相關次數: 點閱:357下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在先進的超大型積體電路設計中,一個晶圓上可能會有上億個電晶體,因此積體電路封裝在晶片設計流程中越趨重要。細間距球柵陣列被廣泛的應用於空間非常限制之應用,例如行動裝置、手持裝置等等。為了解決複雜的設計規則,基板連接通常由有經驗之工程師手動完成,但是基板連接非常複雜,因此手動完成是非常耗時以及經常出錯的。我們提出基於整數線性規劃的自動繞線器來加速工程師完成基板繞線,並且同時考慮複雜的設計限制以及不協調的鑽孔大小。更進一步提出三個減少整數線性規劃中限制的方法來加速時間,實驗結果顯示我們提出來之架構可以有效的降低基板連接的設計時間。


    In advanced very-large-scale integration (VLSI) design, billions of transistors could be fabricated on the same die.
    Integration circuit (IC) packaging has become one of the most important steps in IC design flow.
    Fine pitch ball grid array (FBGA) is widely used in space constrained applications, such as mobile and handheld devices.
    These packaging substrate interconnections are usually customized by layout engineers taking many complex and stringent design rules into considerations.
    However, fully net-by-net manual design for FBGA is time consuming and error-prone.
    In this thesis, we propose an integer linear programming (ILP) based router for wire-bonding FBGA packaging design.
    Our ILP formulation takes design-dependent constraints and mismatched via dimension into account.
    Three ILP constraint reduction techniques are developed to boost the run time of ILP optimization.
    Experimental results indicate that our framework could effectively reduce the substrate layout design cycle time.

    ABSTRACT List of Tables List of Figures CHAPTER 1. Introduction 1.1 Package Background 1.2 Fine Pitch Ball Grid Array 1.3 Mismatched Via Dimension 1.4 Motivation CHAPTER 2. Preliminaries 2.1 Previous Works 2.2 Square Lattice Grid Graph Model 2.3 Problem Formulation CHAPTER 3. ILP-Based MCMF Problem 3.1 Algorithm Flow 3.2 Graph Construction 3.3 ILP Formulation 3.4 ILP Relaxation CHAPTER 4. ILP Constraint Reduction 4.1 Via Pattern Selection 4.2 Via Entry Edges Identification 4.3 Wire Constraint Integration CHAPTER 5. Experimental Results 5.1 Experimental Setup 5.2 Progressive Output Solution 5.3 Import Routing Results back to Cadence APD 5.4 Routing Results 5.5 ILP Constraint Reduction Results CHAPTER 6. Conclusion Bibliography

    [1] William Greig, ''Integrated Circuit Packaging, Assembly and Interconnections'', Springer, 2007.
    [2] Interal discussion, Package Design Engineering, ASE Group ChungLi, 2018.
    [3] C. C. Tsai, C. M. Wang, and S. J. Chen, ''NEWS: A net-even-wiring system for the routing on a multilayer PGA package,'' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp.182-189, vol.17, i.2, 1998.
    [4] S. S. Chen, J. J. Chen, T. Y. Lee, C. C. Tsai, and S. J. Chen, ''A new approach to the ball grid array package routing,'' IEICE Transactions on Fundamentals, pp.2599-2608, vol.E82-A, i.11, 1999.
    [5] Y. Kubo and A. Takahashi, ''Global routing by iterative improvements for two-layer ball grid array packages,'' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}, pp.725-733, vol.25, i.4, 2006.
    [6] Y. Tomioka and A. Takahashi, ''Routability driven via assignment method for 2-layer ball grid array packages,'' IEICE Transactions on Fundamentals, pp.1433-1441, vol.E92-A, i.6, 2009.
    [7] J. W. Fang, C. H. Hsu and Y. W. Chang, ''An integer linear programming based routing algorithm for flip-chip design,'' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp.98-110, vol.28, i.1, 2009.
    [8] C. W. Lin, P. W. Lee, Y. W. Chang, C. F. Shen, and W. C. Tseng, ''An efficient pre-assignment routing algorithm for flip-chip designs,'' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp.878-889, vol.31, i.6, 2012.
    [9] X. Jia, Y. Cai, Q. Zhou, and B. Yu, ''A multicommodity flow-based detailed router with efficient acceleration techniques,'' IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems, pp.217-230, vol.37, i.1, Jan. 2018.
    [10] Cadence Allegro Package Designer 16.6. https://www.cadence.com/.
    [11] Gurobi Optimizer 8.1. http://www.gurobi.com/.
    [12] J. S. Wu, ''Optimization strategies for integer linear programming based ball grid array substrate router,'' M. S. thesis, National Taiwan University of Science and Technology, Taipei, Taiwan, 2019.

    QR CODE