跳到主要內容

臺灣博碩士論文加值系統

(44.211.31.134) 您好!臺灣時間:2024/07/22 20:38
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:蔡賀城
研究生(外文):Tsai, He-Cheng
論文名稱:長度匹配之區域繞線流程印刷電路板
論文名稱(外文):A Length Matching Routing Area Routing Flow for PCB Designs
指導教授:曾建超曾建超引用關係李毅郎
指導教授(外文):Tsneg, Chien-ChaoLi, Yih-Lang
口試委員:曾建超李毅郎林家民
口試委員(外文):Tsneg, Chien-ChaoLi, Yih-LangLin, Jai-Ming
口試日期:2021-10-13
學位類別:碩士
校院名稱:國立陽明交通大學
系所名稱:網路工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2021
畢業學年度:110
語文別:英文
論文頁數:33
中文關鍵詞:長度匹配區域繞線印刷電路板
外文關鍵詞:Length MatchingArea RoutingPCB Designs
相關次數:
  • 被引用被引用:0
  • 點閱點閱:225
  • 評分評分:
  • 下載下載:21
  • 收藏至我的研究室書目清單書目收藏:0
現在的印刷版電路繞線變得越來越複雜,所以印刷版電路繞線的難度也越來越高。印刷版電路繞線中的繞線我們會分成兩個部分,逃離繞線與區域繞線,逃離繞線指的是接點逃離該晶片區塊的繞線,而區域繞線指的是晶片到晶片之間的繞線,而會分成兩個部分是因為印刷版電路繞線中有一個重要的製造性規範,就是目前在訊號在同一群組中到達的時間要相同,我們會以控制線長的方式,去滿足這個製造性規範,而因為進行控制線長對於空間有很大的要求,在晶片中是很難去完成的,所以我們才會將繞線分成兩個部分,並在區域繞線時進行長度控制。在本篇論文中我們主要針對區域繞線中控制線長的部分 ,提出一個以全局繞線先配置好大致的繞線路徑,再以蛇行繞線去延長線長的繞線流程。最後我們在嚴格的業界的測資中,我們可以完成目前所有的設計。
Nowadays, printed circuit board (PCB) routing has become more complicated, so it also becomes harder to complete the routing of PCB. In PCB routing, we can divide a PCB routing into two parts, escape and area routing. Escape routing is the routing from the pins of a chip to the escape locations of its boundary. Area routing is the routing to connect the escape locations along the boundaries of all chips. There is an important design rule constraint (DRC) that requires the signals in the same group to arrive at the same time. We satisfy this DRC by controlling the length of all nets in a group, named it a length-matching constraint. Length matching needs to consume many routing resources, it is hard to satisfy the length-matching constraint in a crowded chip, so we divide a PCB routing into two parts, and satisfy the length-matching constraint in the area routing. In this thesis, we focus on length matching in the area routing and propose a routing flow with global routing and detailed snaking routing. Finally, this flow can be employed to tackle all of the industrial designs imposed with difficult industry manufacturing rules.
摘要
i
ABSTRACT ii
Acknowledgement iv
Table of Contents v
List of Figures vii
List of Tables ix
Chapter 2. Preliminary 4
Chapter 3. Proposed Routing Flow 6
3.1 Routing Flow Overview 6
3.2 Concurrent Global Routing 7
3.2.1 Routing Connectivity 8
3.2.2 Capacity of Edge 9
3.2.3 Overlapping Constraints 10
3.2.4 Snaking Area Assignment 12
3.2.5. Length Matching 14
3.3 Detailed Routing 15
3.3.1 Preprocessing 16
3.3.2 Boundary Routing 17
3.3.3 Snaking Area Assignment 19
3.3.4 US Routing 20
3.3.5 Wire extension 23
Chapter 4. Experiment Result 25
Chapter 5. Conclusion 29
Reference 30
[1] M. M. Ozdal and M. D. F. Wong, "Algorithmic Study of Single- Layer Bus Routing for High-Speed Boards," IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 25, no. 3, pp. 490-503, 2006.
[2] T. Yan, M. D.-F. Wong, "Recent research development in PCB layout", Proc. ICCAD, pp. 398-403, 2010.
[3] L. W. Ritchey, J. Zasio, K. J. Knack, "Right the First Time: A Practical Handbook on High Speed PCB and System Design", Speeding Edge, 2006.
[4] D. Brooks, Signal Integrity Issues and Printed Circuit Board Design. Prentice Hall, 2003.
[5] L. Luo and D. F. Wong, “Ordered Escape Routing Based on Boolean Satisfiability,” IEEE/ACM Asia and South Pacific Design Automation Conference (ASP-DAC), 2008, pp.244-249.
[6] T. Yan, M. D.-F. Wong, "A correct network flow model for escape routing", Proc. ACM/IEEE Des. Autom. Conf., pp. 332-335, 2009-Jul.
[7] M. M. Ozdal and M. D. F. Wong, "Simultaneous escape routing and layer assignment for dense PCBs," IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2004, pp. 822-829
[8] R. Zhang, T. Pan, L. Zhu, and T. Watanabe, "A length matching routing method for disordered pins in pcb design", in: Design Automation Conference (ASP-DAC) 2015 20th Asia and South Pacific, pp. 402-407, 2015.
[9] Jin-Tai Yan, "Length-Matching-Constrained Region Routing in
Rapid Single-Flux-Quantum Circuits", IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 40, no. 5, pp. 945 – 956, 2021.
[10] T. Yan and M. D. F. Wong, "Bsg-route: a length-matching router for general topology", IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2008, pp. 499-505.
[11] M. M. Ozdal and M. D. F. Wong, "Length-matching routing for high-speed printed circuit boards", IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2003, pp. 394.
[12] Ph.D. dissertation of S. T. Lin. " A Study of Routing Methodologies on Standard Cell and PCB Designs ", National Yang Ming Chiao Tung University, Hsinchu, Taiwan, 2021.
[13] Master's thesis of H. H. Wang. "Max-SAT-based Multi-Layer Simultaneous Escape Routing", National Yang Ming Chiao Tung University, Hsinchu, Taiwan, 2021.
[14] D. Park, D. Lee, I. Kang, S. Gao, B. Lin and C. -K. Cheng, "SP&R: Simultaneous Placement and Routing framework for standard cell synthesis in sub-7nm," 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC), 2020, pp. 345-350.
[15] N. Een and N. Sorensson, “Translating pseudo-Boolean constraints into SAT,” Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, 2006, pp. 1–26.
[16] Bjørner N., Phan AD., Fleckenstein L. (2015) νZ - An Optimizing SMT Solver. In: Baier C., Tinelli C. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2015. Lecture Notes in Computer Science, vol 9035. Springer, Berlin, Heidelberg.
[17] Nieuwenhuis, Robert & Oliveras, Albert & Tinelli, Cesare. (2006). Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL. J. ACM. 53. 937-977.
[18] Manolios P., Papavasileiou V. (2013) ILP Modulo Theories. In: Sharygina N., Veith H. (eds) Computer Aided Verification. CAV 2013. Lecture Notes in Computer Science, vol 8044. Springer, Berlin, Heidelberg
[19] W. Liu, Y. Li and C. Koh, "A fast maze-free routing congestion estimator with hybrid unilateral monotonic routing," 2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 2012, pp. 713-719.
[20] Y. Kohira, S. Suehiro and A. Takahashi, "A Fast Longer Path Algorithm for Routing Grid with Obstacles using Biconnectivity based Length Upper Bound", ASPDAC, pp. 600-605, 2009.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top