A routing algorithm for graphene nanoribbon circuit

Tan Yan, Qiang Ma, Scott Chilstedt, Martin D. F. Wong, Deming Chen

Research output: Contribution to journalJournal articlepeer-review

18 Citations (Scopus)


Conventional CMOS devices are facing an increasing number of challenges as their feature sizes scale down. Graphene nanoribbon (GNR) based devices are shown to be a promising replacement of traditional CMOS at future technology nodes. However, all previous works on GNRs focus at the device level. In order to integrate these devices into electronic systems, routing becomes a key issue. In this article, the GNR routing problem is studied for the first time. We formulate the GNR routing problem as a minimum hybrid-cost shortest path problem on triangular mesh (“hybrid” means that we need to consider both the length and the bending of the routing path). We show that by graph expansion, this minimum hybrid-cost shortest path problem can be solved by applying the conventional shortest path algorithm on the expanded graph. Experimental results show that our GNR routing algorithm effectively handles the hybrid cost.
Original languageEnglish
Article number61
Pages (from-to)1–18
Number of pages18
JournalACM Transactions on Design Automation of Electronic Systems
Issue number4
Publication statusPublished - Oct 2013

User-Defined Keywords

  • Design
  • Algorithms
  • Routing
  • graphene nanoribbons


Dive into the research topics of 'A routing algorithm for graphene nanoribbon circuit'. Together they form a unique fingerprint.

Cite this