MCM電子構裝佈局設計自動化---子計畫五:適用於MCM之限制性穿孔減少

dc.contributor國立臺灣師範大學資訊教育研究所zh_tw
dc.contributor.author張國恩zh_tw
dc.date.accessioned2014-10-30T09:32:22Z
dc.date.available2014-10-30T09:32:22Z
dc.date.issued1997-07-01zh_TW
dc.description.abstract佈線中的限制性穿孔減少(Constrained via minimization,簡稱CVM)問題是探討如何決定佈局中各線段(Segments)所處的佈局層(Layer),使得所產生的穿孔數最少。本計畫嘗試將CVM問題轉換成圖形的縮減問題,然後按照所建的圖形縮減模式設計出相關的演算法以解決此問題。計畫中的方法曾用在VLSI的通道佈線上 (Channel routing),並得到相當好的結果。在計畫中嘗試將該方法用到PCB/MCM的應用上。由於PCB與MCM的設計與VLSI不同,故所考慮的限制也不同,因此PCB/MCM的穿孔減少問題是值得探討的。本計畫已完成初步的程式設計,並繼續推導理論使能考慮在MCM設計中Distribution vias,Stacked vias與Interconnection vias之特性。zh_tw
dc.description.abstractThe constrained via minimization (CVM) problem for MCM routing is the problem of determining which layers can be used for routing the wire segments in the interconnections of nets so that the number of vias is minimized. In this project, we first transform the problem of CVM for multilayer MCM routing to the graph contractability problem and then a heuristic algorithm is proposed on the basis of the graph contractability model. The project has completed the implementation of via minimization algorithm under WINDOW environment. The project will continuously address the theories for meeting the requirements in the MCM design and consider the constraints of distribution vias, stacked vias, and interconnection vias.en_US
dc.identifierntnulib_tp_A0904_04_017zh_TW
dc.identifier.urihttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/34505
dc.languagechizh_TW
dc.relation(國科會專題研究計畫,NSC86-2221-E003-001)zh_tw
dc.subject.other多晶片模組zh_tw
dc.subject.other印刷電路板zh_tw
dc.subject.other限制性穿孔減少zh_tw
dc.subject.other通道繞線zh_tw
dc.subject.otherMultichip module (MCM)en_US
dc.subject.otherPrinted circuit board (PCB)en_US
dc.subject.otherConstrained via minimizationen_US
dc.subject.otherChannel routingen_US
dc.subject.otherMCMen_US
dc.titleMCM電子構裝佈局設計自動化---子計畫五:適用於MCM之限制性穿孔減少zh_tw
dc.titleConstrained Via Minimization for Multichip Modules. (I)en_US

Files

Collections