https://scholars.lib.ntu.edu.tw/handle/123456789/636603
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Liu, Qinghai | en_US |
dc.contributor.author | Tang, Qinfei | en_US |
dc.contributor.author | Chen, Jiarui | en_US |
dc.contributor.author | Chen, Chuandong | en_US |
dc.contributor.author | Zhu, Ziran | en_US |
dc.contributor.author | He, Huan | en_US |
dc.contributor.author | Chen, Jianli | en_US |
dc.contributor.author | YAO-WEN CHANG | en_US |
dc.date.accessioned | 2023-10-26T06:41:07Z | - |
dc.date.available | 2023-10-26T06:41:07Z | - |
dc.date.issued | 2023-01-01 | - |
dc.identifier.isbn | 9798350323481 | - |
dc.identifier.issn | 0738100X | - |
dc.identifier.uri | https://scholars.lib.ntu.edu.tw/handle/123456789/636603 | - |
dc.description.abstract | PCB routing becomes time-consuming as the complexity of PCB design increases. Unlike traditional schemes that treat the two essential PCB routing processes separately, namely, escape and bus routing, we consider the continuity between them and present a golden-pin-based routing scheme to find the desired solution with angle and topology constraints. Further, conventional rip-up and reroute methods are often ineffective and inefficient for congestion alleviation and routability optimization. We construct a component graph by modeling components as vertices and applying the minimum weight vertex covering method to improve the routability. A self-adaptable ordering method is presented for escape routing to arrange the pin order on the component boundary, guaranteeing successful bus routing. In addition, escape routing is performed based on a disjoint path method. We construct a dynamic Hanan grid in bus routing and utilize a novel congestion adjustment technique to improve solution quality. Compared with FreeRouting and Allegro, the experiment results show that our algorithm achieves high routability and a significant 90% runtime reduction. | en_US |
dc.relation.ispartof | Proceedings - Design Automation Conference | en_US |
dc.subject | bus routing | disjoint path | escape routing | en_US |
dc.title | Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints | en_US |
dc.type | conference paper | en_US |
dc.identifier.doi | 10.1109/DAC56929.2023.10247728 | - |
dc.identifier.scopus | 2-s2.0-85173114581 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85173114581 | - |
dc.relation.journalvolume | 2023-July | en_US |
dc.relation.pageend | 6 | en_US |
item.fulltext | no fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_5794 | - |
item.cerifentitytype | Publications | - |
item.openairetype | conference paper | - |
item.grantfulltext | none | - |
crisitem.author.dept | Electronics Engineering | - |
crisitem.author.dept | Electrical Engineering | - |
crisitem.author.dept | Computer Science and Information Engineering | - |
crisitem.author.dept | Center for Information and Electronics Technologies | - |
crisitem.author.dept | MediaTek-NTU Research Center | - |
crisitem.author.orcid | 0000-0002-0564-5719 | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | Others: University-Level Research Centers | - |
crisitem.author.parentorg | Others: University-Level Research Centers | - |
顯示於: | 電信工程學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。