mirage

Circuit-simulated obstacle-aware Steiner routing

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

Circuit-simulated obstacle-aware Steiner routing

Show full item record

Title: Circuit-simulated obstacle-aware Steiner routing
Author: Shi, Yiyu; Mesa, Paul; Yu, Hao; He, Lei
Copyright year: 2007
Abstract: This article develops circuit-simulated routing algorithms. We model the routing graph by an RC network with terminals as inputs, and show that the faster an output reaches its peak, the higher the possibility for the corresponding Hanan or escape node to become a Steiner point. This enables us to select Steiner points and then apply any minimum spanning tree algorithm to obtain obstaclefree or obstacle-aware Steiner routing. Compared with existing algorithms, our algorithms have significant gain on either wirelength or runtime for obstacle-free routing, and on both wirelength and runtime for obstacle-aware routing.
Type: Journal Article
Series/ Journal Title: ACM transactions on design automation of electronic systems
School: School of Electrical and Electronic Engineering
Rights: © 2007 ACM. This is the author created version of a work that has been peer reviewed and accepted for publication by ACMTransactions onDesign Automation of Electronic Systems, ACM. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1145/1255456.1255465].
Version: Accepted version

Files in this item

Files Size Format View
a28-shi.pdf 527.4Kb PDF View/Open
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record