Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • 首頁
  • 研究成果檢索
  • 研究人員
  • 單位
  • 計畫
  • 分類瀏覽
    • 研究成果檢索
    • 研究人員
    • 單位
    • 計畫
  • 機構典藏
  • SDGs
  • 登入
  • 中文
  • English
  1. National Taiwan Ocean University Research Hub
  2. 電機資訊學院
  3. 資訊工程學系
請用此 Handle URI 來引用此文件: http://scholars.ntou.edu.tw/handle/123456789/26631
DC 欄位值語言
dc.contributor.authorYan, Jin-Taien_US
dc.contributor.authorYen, Chia-Hengen_US
dc.date.accessioned2026-08-10T03:11:33Z-
dc.date.available2026-08-10T03:11:33Z-
dc.date.issued2026/4/1-
dc.identifier.issn0278-0070-
dc.identifier.urihttp://scholars.ntou.edu.tw/handle/123456789/26631-
dc.description.abstractIt is known that graphene nanoribbon (GNR) can be used as interconnects in nanoscale designs. To reduce the manufacturing cost in GNR routing, the constraint on the number of used layers becomes more important. In this article, given a set of GNR nets on a constrained set of routing layers inside a limited area, based on the concept of using GNR wires with CNT-via insertion in GNR routing, an efficient routing algorithm can be proposed to maximize the routability of the GNR nets and minimize the total wirelength in assignment of the feasible routed paths while satisfying the noncrossing constraint on the GNR nets. First, based on the construction of a crossing graph on the length-oriented consideration of the multiple-pin nets, all the intervals representing the GNR nets with covering compatibility can be assigned to the minimized tracks, and the represented intervals on the extra tracks can be reassigned to the constrained tracks by using two separation-and-reassignment operations. Furthermore, based on the assignment result of the represented intervals on the constrained tracks and the hierarchical covering tree of the independent nets and the separated subnets on the constrained layers, the full and partial boundary-oriented paths of the GNR nets can be assigned on the constrained layers for routability, and the assigned paths of the GNR nets can be modified to reduce the number of used bends and the total wirelength of the GNR nets. Compared with the combination of Yen's routing algorithm and the rip-up and reroute (RAR) process in layer-constrained GNR area routing with CNT-via insertion, the proposed algorithm can increase 2.1% of routability for 12 tested examples under 24 different constraints on average. In addition, the proposed algorithm can reduce 31.6% of the number of inserted CNT-vias, 5.5% of the number of used bends, and 2.3% of the total wirelength for 12 tested examples under 13 different constraints with 100% routability on average.en_US
dc.language.isoEnglishen_US
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_US
dc.relation.ispartofIEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMSen_US
dc.subjectRoutingen_US
dc.subjectWiresen_US
dc.subjectMetalsen_US
dc.subjectDelaysen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectDesign automationen_US
dc.subjectNickelen_US
dc.subjectContact resistanceen_US
dc.subjectGrapheneen_US
dc.subjectBendingen_US
dc.subjectCNT-viaen_US
dc.subjectCNT-via insertionen_US
dc.subjectgraphene nanoribbon (GNR) routingen_US
dc.subjectGNR wireen_US
dc.subjectlayer constrainten_US
dc.titleLayer-Constrained GNR Area Routing With CNT-Via Insertion for Via Minimizationen_US
dc.typejournal articleen_US
dc.identifier.doi10.1109/TCAD.2025.3604646-
dc.identifier.isiWOS:001723877500026-
dc.relation.journalvolume45en_US
dc.relation.journalissue4en_US
dc.relation.pages14en_US
dc.identifier.eissn1937-4151-
item.fulltextno fulltext-
item.languageiso639-1English-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.grantfulltextnone-
item.openairetypejournal article-
item.cerifentitytypePublications-
crisitem.author.deptDepartment of Computer Science and Engineering-
crisitem.author.deptCollege of Electrical Engineering and Computer Science-
crisitem.author.deptNational Taiwan Ocean University,NTOU-
crisitem.author.parentorgCollege of Electrical Engineering and Computer Science-
crisitem.author.parentorgNational Taiwan Ocean University,NTOU-
顯示於:資訊工程學系
顯示文件簡單紀錄

Google ScholarTM

檢查

Altmetric

Altmetric

TAIR相關文章


在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

瀏覽
  • 機構典藏
  • 研究成果檢索
  • 研究人員
  • 單位
  • 計畫
DSpace-CRIS Software Copyright © 2002-  Duraspace   4science - Extension maintained and optimized by NTU Library Logo 4SCIENCE 回饋