請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38288
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 陳少傑(Sao-Jie Chen) | |
dc.contributor.author | Tsung-Yi Ho | en |
dc.contributor.author | 何宗易 | zh_TW |
dc.date.accessioned | 2021-06-13T16:29:34Z | - |
dc.date.available | 2006-07-21 | |
dc.date.copyright | 2005-07-21 | |
dc.date.issued | 2005 | |
dc.date.submitted | 2005-07-12 | |
dc.identifier.citation | [1] http://www.cadence.com/
[2] http://www.intel.com/ [3] http://www.magma-da.com [4] http://www.synopsys.com [5] http://www.xinitiative.org/ [6] C. Albrecht, “Global routing by new approximation algorithms for multi- commodity flow, ” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, no. 5, pp. 622-632, May 2001. [7] C. J. Alpert, J.-H. Huang, and A. B. Kahng, “Multilevel circuit partitioning,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 8, pp. 655-667, Aug. 1998. [8] S. H. Batterywala, N. Shenoy, W. Nicholls, and H. Zhou, “Track assignment: A desirable intermediate step between global routing and detailed routing,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 59-66, Nov. 2002. [9] M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd Edition, Springer-Verlag 2000. [10] M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 2, no. 4, pp. 223-234, Oct.1983. [11] T. F. Chan, J. Cong, T. Kong, J. R. Shinnerl, “Multilevel optimization for large-scale circuit placement,” in Proc. IEEE International Conference on Computer- Aided Design, pp. 171-176, Nov. 2000. [12] Y.-W. Chang, K. Zhu and D. F. Wong, “Timing-driven routing for symmetrical- array-based FPGAs,” ACM Trans. on Design Automation of Electronic Systems, vol. 5, no. 3, pp. 433-450, Jul. 2000. [13] Y. W. Chang and S. P. Lin, “MR: A new framework for multilevel full-chip routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 23, no. 5, pp. 793-800, May 2004. [14] K. Chaudhary, A Onozawa, and E. S. Kuh, “A spacing algorithm for performance and crosstalk reduction,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 697-702, Nov. 1993. [15] P. H. Chen, S. Malkani, C.-M. Peng, and J. Lin, “Fixing antenna problem by dynamic diode dropping and jumper insertion,” in Proc. IEEE International Symposium on Quality Electronic Design, pp 275-282, Mar. 2000. [16] H. Chen, C. K. Cheng, A. B. Khang, I. I. Mandoiu, Q. Wang, and B. Yao, “The Y-Architecture for on-chip interconnect: Analysis and methodology,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 13-19, Nov. 2003. [17] H. Chen, B. Yao, F. Zhou, and C. K. Cheng, “The Y-Architecture: Yet another on-chip interconnect solution,” in Proc. ACM/IEEE Asia South Pacific Design Automation Conference, pp. 840-846, Jan. 2003. [18] Z. Chen and I. Koren, “Layer reassignment for antenna effect minimization in 3-layer channel routing,” Proc. IEEE Workshop on Defect and Fault-Tolerance, pp 77-85, Nov. 1996. [19] B. Choi, C. Chiang, J. Kawa, and M. Sarrafzadeh, “Routing resources consumption on M-arch and X-arch,” in Proc. IEEE International Symposium on Circuits and Systems, pp. V-73-V-76, May 2004. [20] J. Cong, J. Fang and K. Khoo, “DUNE: A multi-layer gridless routing system with wire planning,” in Proc. ACM International Symposium on Physical Design, pp. 12-18, Apr. 2000. [21] J. Cong, J. Fang and Y. Zhang, “Multilevel approach to full-chip gridless routing,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 396-403, Nov. 2001. [22] J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, “Provably good performance-driven global routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 11, no. 6, pp. 739-752, Jun. 1992. [23] J. Cong, S. Lim, and C. Wu, “Performance driven multilevel and multiway partitioning with retiming,” in Proc. ACM/IEEE Design Automation Conference, pp. 274-279, Jun. 2000. [24] J. Cong and P. H. Madden, “Performance driven global routing for standard cell design,” in Proc. ACM International Symposium on Physical Design, pp. 73-80, Apr. 1997. [25] J. Cong and J. Shinnerl, Multilevel optimization in VLSICAD, Kluwer Academic Publishers, 2003. [26] J. Cong, M. Xie and Y. Zhang, “An enhanced multilevel routing system,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 51-58, Nov. 2002. [27] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, MIT Press, 2001. [28] C. S. Coulston, “Constructing exact octagonal steiner minimal trees,” in Proc. ACM Great Lake System on VLSI, pp. 1-6, Apr. 2003. [29] T. Deguchi, T. Koide and S. Wakabayashi, “Timing-driven hierarchical global routing with wire-sizing and buffer-insertion for VLSI with multi-routing-layer,” in Proc. ACM/IEEE Asia South Pacific Design Automation Conference, pp. 99-104, Jan. 2000. [30] W. C. Elmore, “The transient response of damped linear networks with particular regard to wide band amplifiers,” J. Appl. Phys., vol. 19, pp. 55-63, Jan. 1948. [31] M. R. Garey, R. L. Graham, and D. S. Johnson, “The complexity of computing steiner minimal trees,” SIAM Journal on Applied Mathematics, pp. 835-859, Jun. 1977. [32] M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980. [33] L. Guibas and J. Stolfi, “Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,” ACM Transactions on Graphics, pp. 74-123, Apr. 1985. [34] A. Hashimoto and J. Stevens, “Wire routing by optimizing channel assignment within large apertures,” in Proc. ACM/IEEE Design Automation Conference, pp.155-169, Jun. 1971. [35] M. Hayashi and S. Tsukiyama, “A hybrid hierarchical global router for multi-layer VLSI's,” IEICE Trans. Fundamentals, vol. E78-A, no. 3, pp. 337-344, 1995. [36] J. M. Ho, C. H. Chang, D. T. Lee, and C. K. Wong, “Minimum Diameter Spanning Trees and Related Problems,” SIAM J. Computing, vol. 20, no. 5, pp. 987-997, Oct. 1991. [37] H. T. Heineken, J. Khare, W. Maly, P. K. Nag, C. Ouyang, and W. A. Pleskacz, “CAD at the design-manufacturing interface,” in Proc. ACM/IEEE Design Automation Conference, pp. 321-326, Jun. 1997. [38] J. Heisterman and T. lengauer, “The efficient solutions of integer programs for hierarchical global routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 10, no. 6, pp. 748-753, Jun. 1991. [39] D. Hightower, “A solution to line routing problems on the continuous plane,” in Proc. ACM/IEEE Design Automation Workshop, pp. 1-24, Jun. 1969. [40] T.-Y. Ho, Y.-W. Chang, and S.-J. Chen, “Crosstalk-Driven Multilevel Full-Chip Routing,” in Proc. the 14th VLSI Design/CAD Symposium, pp. 25-28, Aug. 2003. [41] T.-Y. Ho, Y.-W. Chang, S.-J. Chen, and D. T. Lee, “A fast crosstalk- and performance-driven multilevel routing system,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 382-387, Nov. 2003. [42] T.-Y. Ho, Y.-W. Chang, and S.-J. Chen, “Multilevel routing with antenna avoidance,” in Proc. ACM International Symposium on Physical Design, pp. 34-40, Apr. 2004. [43] T.-Y. Ho, Y.-W. Chang, and S.-J. Chen, “Multilevel routing with jumper insertion for antenna avoidance,” in Proc. IEEE International SOC Conference, pp. 63-66, Sep. 2004. [44] T.-Y. Ho, C.-F. Chang, Y.-W. Chang, and S.-J. Chen, “Multilevel full-chip routing for the X-based architecture,” in Proc. ACM/IEEE Design Automation Conference, pp. 597-602, Jun. 2005. [45] T.-Y. Ho, Y.-W. Chang, S.-J. Chen, and D. T. Lee, “Crosstalk- and performance-driven multilevel full-chip routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 6, pp. 869-878, Jun. 2005. [46] L.-D. Huang, X. Tang, H. Xiang, D. F. Wong, and I.-M. Liu, “A polynomial time optimal diode insertion/routing algorithm for fixing antenna problem,” in Proc. ACM/IEEE Design Automation and Test in Europe, pp. 470-475, Feb. 2002. [47] The International Technology Roadmap for Semiconductors, 2001. [48] A. B. Kahng, “Research directions for coevolution of rules and routers,” in Proc. ACM International Symposium on Physical Design, pp. 122-125, Apr. 2003. [49] A. B. Kahng, I. Mandoiu, and A. Zelikovsky, “High scalable algorithms for rectilinear and octilinear steiner trees,” in Proc. ACM/IEEE Asia South Pacific Design Automation Conference, pp. 827-833, Jan. 2003. [50] G. Karypis, R. Aggarwal, V. Kumar, and S. shekhar, “Multilevel hypergraph partitioning: Application in VLSI domain,” IEEE Trans. on VLSI Systems, vol. 7, no. 1, pp. 69-79, Mar. 1999. [51] R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh, “Pattern routing: use and theory for increasing predictability and avoiding coupling,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 7, pp. 777-790, Nov. 2002. [52] R. Kay and R. A. Rutenbar, “Wire packing: A strong formulation of crosstalk-aware chip-level track/layer assignment with an efficient integer programming solution,” in Proc. ACM International Symposium on Physical Design, pp. 61-68, Apr. 2000. [53] C. K. Koh and P. H. Madden, “Manhattan or Non-Manhattan? A study of alternative VLSI routing architectures,” in Proc. ACM Great Lake System on VLSI, pp. 47-52, Apr. 2000. [54] S. Krishnan, S. Rangan, S. Hattangady, G. Xing, K. Brennan, M. Rodder, and S. Ashok, “Assessment of charge-induced damage to ultra-thin gate MOSFETs,” in Proc. IEEE International Electron Devices Meeting, pp. 445-448, Dec. 1997. [55] C. Y. Lee, “An Algorithm for Path Connection and its Application,” IRE Transactions on Electronic Computers, vol. EC-10, no. 3, pp. 346-365, Sep. 1961. [56] D. T. Lee and C. F. Shen, “The Steiner Minimal Tree Problem in the lambda-Geometry Plane,” Proc. International Symposium on Algorithms and Computation, pp. 247-255, Dec. 1996. [57] S.-C. Lee, Y.-W. Chang, J.-M. Hsu, and H. Yang, “Multilevel large-scale module floorplanning/placement using B*-trees,” in Proc. ACM/IEEE Design Automation Conference, pp. 812-817, Jun. 2003. [58] H. K.-S. Leung, “Advanced routing in changing technology landscape,” in Proc. ACM International Symposium on Physical Design, pp. 118-121, Apr. 2003. [59] S.-P. Lin and Y.-W. Chang, “A novel framework for multilevel routing considering routability and performance,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 44-50, Nov. 2002. [60] Y.-L. Lin, Y.-C. Hsu, and F.-S. Tsai, “Hybrid routing,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 9, no. 2, pp. 151-157, Feb. 1990. [61] W. Maly, C. Ouyang, S. Ghosh, and S. Maturi, “Detection of an antenna effect in VLSI designs,” in Proc. International Symposium on Defect and Fault Tolerance in VLSI Systems, pp. 86-94, Nov. 1996. [62] M. Marek-Sadowska, “Global Router for gate array,” in Proc. IEEE International Conference on Computer Design, pp. 332-337, Oct. 1984. [63] M. Marek-Sadowska, “Router planner for custom chip design,” in Proc. IEEE International Conference on Computer-Aided Design, pp. 246-249, Nov. 1986. [64] R. H. J. M. Otten, R. Camposano, and P. R. Groeneveld, “Design automation for deep submicron: present and future,” in Proc. ACM/IEEE Design Automation and Test in Europe, pp. 650-657, Feb. 2002. [65] M.Paluszewski, P. Winter, and M. Zachariasen, “A new paradigm for general architecture routing,” in Proc. ACM Great Lake Symposium on VLSI, pp. 202-207, Apr. 2004. [66] L. K. Scheffer, “Physical CAD changes to incorporate design for lithography and manufacturability,” in Proc. ACM/IEEE Asia South Pacific Design Automation Conference, pp. 768-773, Jan. 2004. [67] D. Y. Seo and D. T. Lee, “On the complexity of bicriteria spanning tree problems for a set of points in the plane,” PhD Dissertation, Northwestern University, 1999. [68] H. Shin, C.-C. King, and C. Hu, “Thin oxide damage by plasma etching and ashing process,” in Proc. IEEE International Reliability Physics Symposium, pp. 37-41, Apr. 1992. [69] H. Shirota, T. Sadakane, M. Terai, and K. Okazaki, “A new router for reducing “Antenna effect” in ASIC design,” in Proc. IEEE Custom Integrated Circuit Conference, pp. 27.5.1-27.5.4, Sep. 1998. [70] J. Soukup, “Fast maze router,” in Proc. ACM/IEEE Design Automation Conference, pp. 100-102, Jun. 1978. [71] M. Sriram, S. Kang, J. D. Cho, and S. Raje, and M. Sarrafzadeh “Crosstalk- minimum layer assignment,” in Proc. IEEE Custom Integrated Circuit Conference, pp. 29.7.1-29.7.4, May. 1993. [72] M. R. Stan, F. Hamzaoglu, and D. Garrett, “Non-manhattan maze routing,” in Proc. Brazilian Symposium on Integrated Circuit Design, pp. 260-265, Feb. 2004. [73] D. Sylvester, C. Hu, O. S. Nakagawa, and S. Y. Oh, “Interconnect scaling: Signal integrity and performance in future high-speed CMOS designs,” in Proc. IEEE VLSI Symposium on Technology, pp. 42-43, Jun. 1998. [74] R. E. Tarjan, Data structures and network algorithms, CMBS 44, SIAM, 1983. [75] S. Teig, “The X Architecture: not your father's diagonal wiring,” in Proc. IEEE System Level Interconnect Prediction, pp. 33-37, Apr. 2002. [76] K. P. Wang, M. Marek-Sadowska, and W. Maly, “Layout design for yield and reliability,” in Proc. ACM Physical Design Workshop, pp. 190-197, Apr. 1996. [77] D. Wang and E. Kuh, “A new timing-driven multilayer MCM/IC routing algorithm,” in Proc. MCM Conference, pp. 89-94, Feb. 1997. [78] H. Watanabe, J. Komori, K. Higashitani, M. Sekine, and H. Koyama , “A wafer level monitoring method for plasma-charging damage using antenna PMOSFET test structure,” IEEE Trans. on Semiconductor Manufacturing, vol. 10, no. 2, pp. 228-232, May 1997. [79] H. Zhou and D. F. Wong, “Global routing with crosstalk constraints,” in Proc. ACM/IEEE Design Automation Conference, pp. 374-377, Jun. 1998. [80] Q. Zhu, H. Zhou, T. Jing, X. Hong, and Y. Yang, “Efficient octilinear steiner tree construction based on spanning graphs,” in Proc. ACM/IEEE Asia South Pacific Design Automation Conference, pp. 687-690, Jan. 2004. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38288 | - |
dc.description.abstract | 由於超大型積體電路技術的快速發展,晶片設計已經到達奈米製程的時代。但在奈米晶片實體設計中,繞線(routing)所造成的問題佔整體晶片設計效能的比例卻逐漸增加且面臨到許多問題,尤其是(1)設計複雜度、(2)訊號完整度(signal-integrity)及(3)製造度(manufacturability)等三大問題急需去處理。因此,本篇論文提出了一創新的多階層繞線器(mSIGMA)來解決訊號完整度及可製造度等問題。
早期的繞線問題是使用直接兩階段繞線方式(flat routing),也就是全域繞線(global routing)及區域繞線(detailed routing)來處理繞線問題,但此解法受限在其對於處理大量資料時的延伸性,為了解決這問題,學者們提出了階層繞線(hierarchical routing)來解決較大量的繞線問題,其使用了分而治之(divide and conquer)的方式來降低問題複雜度,但階層繞線仍受限於其無法保留各切割區塊間的全域資訊,得到更精確的結果,為了解決此問題,學者提出了多階層繞線器來解決以上架構所產生的問題。 多階層架構包含兩個主要步驟:粗糙化(coarsening)及反粗糙化(uncoarsening)。與之前多階層繞線器架構不同的地方是,我們在粗糙化及反粗糙化之間,提出了一軌道指派(track assignment)階段來加快繞線速度及實作最佳化。除了此創新的多階層架構,我們也對串音問題(crosstalk)、效能問題(performance)、天線效應問題(antenna effect)甚至最近提出的X架構(X-architecture)做了深入的研究。實驗結果證明,我們的創新架構比其他方法具有較好的彈性來處理以上的問題。跟之前發表在電子設計自動化重要會議發表的多階層繞線器相比,我們的方法在串音、效能、天線效應及總線長上,都有明顯的改善。在X架構的研究上,跟我們實作在曼哈頓架構(Manhattan architecture)的多階層繞線器相比,在總線長及效能上也都得到了不錯的成果。 | zh_TW |
dc.description.abstract | As technology advances into nanometer territory, the paradigm shift of the routing problem is indispensable to cope with three major challenges: design complexity, signal-integrity problem, and manufacturability problem.
As Moore's Law continues unencumbered into the nanometer era, chips are reaching 100 M gates in size, process geometries have shrunk to 90 nm and below, and engineers have to face compounded design complexity with every new design. These nanometer-scale designs require a new generation of physics-aware and manufacturing- aware routing. At 90 nm and below, there are so many signal-integrity issues that design teams cannot manually correct them all. Nanometer routers must prevent and correct these effects on-the-fly in order to reach timing closure. From a manufacturability standpoint, nanometer routers must explicitly support the ever increasing design complexity, and be capable of adapting to the requirements of timing, signal integrity, process antenna effect, and new interconnect architecture such as X-architecture. In this Dissertation, we propose a novel multilevel full-chip router, namely mSIGMA for SIGnal-integrity and MAnufacturability optimization. To handle the ever increasing design complexity of gigascale integration, the mSIGMA use a multilevel framework that has attracted much attention in the literature recently. The traditional multilevel framework employs a two-stage technique: coarsening followed by uncoarsening. The coarsening stage iteratively groups a set of circuit components (e.g., circuit nodes, cells, modules, routing tiles, etc.) based on a predefined cost metric until the number of components being considered is smaller than a threshold. Then, the uncoarsening stage iteratively ungroups a set of previously clustered circuit components and refines the solution by using optimization techniques. Different with the previous multilevel routing framework, we introduce an intermediate track assignment phase between coarsening and uncoarsening stages, to improve run-time and achieve optimization. To handle the signal-integrity problem, especially the crosstalk problem, we propose a fast layer/track assignment heuristic for crosstalk optimization. We first build the horizontal constraint graph (HCG) for all segments in the panel. For the crosstalk-driven layer assignment problem, we resort to a simple yet efficient heuristic by constructing a maximum spanning tree from the given HCG. Since a tree can be k colored in linear time if we have k layers, we shall first partition the vertices incident on edges with larger costs (coupling lengths) and allocates the corresponding segments to different layers. Then, our track assignment algorithm starts by finding the maximal sets of conflicting segments, and assigns these conflicting segments by the bipartite assignment graph till they are assigned in the panel. To handle the manufacturability problem, such as process antenna effect and the X-architecture, we also propose a desirable track assignment in our multilevel routing framework for manufacturability optimization. To solve the antenna effect, we propose a built-in jumper insertion approach for antenna effect avoidance. To take the advantage of the X-architecture, we also adopt our new multilevel routing framework for the X-based architecture, and the experimental results show the promise of wirelength and delay reduction. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T16:29:34Z (GMT). No. of bitstreams: 1 ntu-94-D90921011-1.pdf: 3566837 bytes, checksum: 5a8b134738646ad2703c8919520fad21 (MD5) Previous issue date: 2005 | en |
dc.description.tableofcontents | ABSTRACT i
TABLE OF CONTENTS iii LIST OF FIGURES vii LIST OF TABLES xi CHAPTER 1 INTRODUCTION 1 1.1 Down to the Wire 1 1.2 Routing Requirements for the Nanometer Era 3 1.2.1 Signal-Integrity Problems 4 1.2.2 Manufacturability Problems 8 1.3 Overview of the Dissertation 11 1.3.1 Multilevel Routing Framework 11 1.3.2 Multilevel Full-Chip Routing Considering Crosstalk and Performance 12 1.3.3 Multilevel Full-Chip Routing Considering Antenna Effect Avoidance 13 1.3.4 Multilevel Full-Chip Routing for the X-Based Architecture 13 1.4 Organization of the Dissertation 14 CHAPTER 2 MULTILEVEL ROUTING FRAMEWORK 15 2.1 Traditional Routing 15 2.1.1 Sequential Approaches 16 2.1.2 Concurrent Approaches 17 2.1.3 Hierarchical Approaches 19 2.2 Multilevel Routing 21 2.2.1 Previous Multilevel Routing Framework 22 2.2.2 Our Multilevel Routing Framework 26 2.2.3 Routing Model 28 2.2.4 Multilevel Routing Model 29 CHAPTER 3 MULTILEVEL FULL-CHIP ROUTING CONSIDERING CROSSTALK AND PERFORMANCE 31 3.1 Introduction 31 3.2 Elmore Delay Model 34 3.3 Multilevel Routing Framework 36 3.3.1 Performance-Driven Routing Tree Construction 37 3.3.2 Crosstalk-Driven Layer/Track Assignment 45 3.4 Experimental Results 50 3.5 Summary 55 CHAPTER 4 MULTILEVEL FULL-CHIP ROUTING CONSIDERING ANTENNA EFFECT AVOIDANCE 57 4.1 Introduction 57 4.2 Antenna Effect Damage 60 4.3 Multilevel Routing Framework 64 4.3.1 Bottom-Up Optimal Jumper Prediction 66 4.3.2 Multilevel Routing with Antenna Avoidance 72 4.3 Experimental Results 76 4.3 Summary 77 CHAPTER 5 MULTILEVEL FULL-CHIP ROUTING FOR THE X-BASED ARCHI- TECTURE 79 5.1 Introduction 79 5.2 Multilevel X Routing Framework 83 5.3 X-Architecture Steiner Tree Construction 85 5.3.1 Three-Terminal Net Routing Based on X-Architecture 86 5.3.2 X-Steiner Tree Algorithm Based on Delaunay Triangulation 90 5.4 Routability-Driven Pattern Routing 91 5.5 Trapezoid-Shaped Track Assignment 93 5.6 Experimental Results 98 5.7 Summary 101 CHAPTER 6 CONCLUSION REMARKS AND FUTURE WORK 103 6.1 Multilevel Routing Framework 103 6.2 Multilevel Full-Chip Routing Framework Considering Crosstalk and Performance 104 6.3 Multilevel Full-Chip Routing Framework Considering Antenna Effect Avoidance 105 6.4 Multilevel Full-Chip Routing Framework for the X-Based Architecture 105 6.5 Future Work 106 BIBLIOGRAPHY 107 | |
dc.language.iso | en | |
dc.title | mSIGMA: 考慮訊號完整度及製造度之多階晶片繞線系統 | zh_TW |
dc.title | mSIGMA: A Multilevel Full-Chip Routing System Considering SIGnal-integrity and MAnufacturability | en |
dc.type | Thesis | |
dc.date.schoolyear | 93-2 | |
dc.description.degree | 博士 | |
dc.contributor.coadvisor | 張耀文(Yao-Wen Chang) | |
dc.contributor.oralexamcommittee | 周景揚(Jing-Yang Jou),林永隆(Youn-Long Lin),劉濱達(Bin-Da Liu),李昆忠(Kuen-Jong Lee),蔡加春(Chia-Chun Tsai),王行健(Sying-Jyan Wang),王廷基(Ting-Chi Wang) | |
dc.subject.keyword | 積體電路實體設計,繞線,訊號完整度,製造度, | zh_TW |
dc.subject.keyword | VLSI Physical Design,Routing,Signal-integrity,Manufacturability, | en |
dc.relation.page | 112 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2005-07-13 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
顯示於系所單位: | 電機工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-94-1.pdf 目前未授權公開取用 | 3.48 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。