Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • Home
  • Research Outputs
  • Researchers
  • Organizations
  • Projects
  • Explore by
    • Research Outputs
    • Researchers
    • Organizations
    • Projects
  • Communities & Collections
  • SDGs
  • Sign in
  • 中文
  • English
  1. National Taiwan Ocean University Research Hub
  2. 電機資訊學院
  3. 資訊工程學系
Please use this identifier to cite or link to this item: http://scholars.ntou.edu.tw/handle/123456789/26631
Title: Layer-Constrained GNR Area Routing With CNT-Via Insertion for Via Minimization
Authors: Yan, Jin-Tai
Yen, Chia-Heng 
Keywords: Routing;Wires;Metals;Delays;Heuristic algorithms;Design automation;Nickel;Contact resistance;Graphene;Bending;CNT-via;CNT-via insertion;graphene nanoribbon (GNR) routing;GNR wire;layer constraint
Issue Date: 2026
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Journal Volume: 45
Journal Issue: 4
Start page/Pages: 14
Source: IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
Abstract: 
It 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.
URI: http://scholars.ntou.edu.tw/handle/123456789/26631
ISSN: 0278-0070
DOI: 10.1109/TCAD.2025.3604646
Appears in Collections:資訊工程學系

Show full item record

Google ScholarTM

Check

Altmetric

Altmetric

Related Items in TAIR


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Explore by
  • Communities & Collections
  • Research Outputs
  • Researchers
  • Organizations
  • Projects
Build with DSpace-CRIS - Extension maintained and optimized by Logo 4SCIENCE Feedback