A routing algorithm for graphene nanoribbon circuit

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

Research output: Contribution to journalArticle

Abstract

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 (US)
Article number61
JournalACM Transactions on Design Automation of Electronic Systems
Volume18
Issue number4
DOIs
StatePublished - Oct 1 2013

Fingerprint

Nanoribbons
Routing algorithms
Graphene
Networks (circuits)
Costs

Keywords

  • Graphene nanoribbons
  • Routing

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

A routing algorithm for graphene nanoribbon circuit. / Yan, Tan; Ma, Qiang; Chilstedt, Scott; Wong, Martin D.F.; Chen, Deming.

In: ACM Transactions on Design Automation of Electronic Systems, Vol. 18, No. 4, 61, 01.10.2013.

Research output: Contribution to journalArticle

@article{9f5280211cf6445081c538cfaff54992,
title = "A routing algorithm for graphene nanoribbon circuit",
abstract = "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.",
keywords = "Graphene nanoribbons, Routing",
author = "Tan Yan and Qiang Ma and Scott Chilstedt and Wong, {Martin D.F.} and Deming Chen",
year = "2013",
month = "10",
day = "1",
doi = "10.1145/2505056",
language = "English (US)",
volume = "18",
journal = "ACM Transactions on Design Automation of Electronic Systems",
issn = "1084-4309",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - A routing algorithm for graphene nanoribbon circuit

AU - Yan, Tan

AU - Ma, Qiang

AU - Chilstedt, Scott

AU - Wong, Martin D.F.

AU - Chen, Deming

PY - 2013/10/1

Y1 - 2013/10/1

N2 - 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.

AB - 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.

KW - Graphene nanoribbons

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=84887846864&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887846864&partnerID=8YFLogxK

U2 - 10.1145/2505056

DO - 10.1145/2505056

M3 - Article

AN - SCOPUS:84887846864

VL - 18

JO - ACM Transactions on Design Automation of Electronic Systems

JF - ACM Transactions on Design Automation of Electronic Systems

SN - 1084-4309

IS - 4

M1 - 61

ER -