Circuit-simulated obstacle-aware Steiner routing
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...
Saved in:
Main Authors: | Shi, Yiyu, Mesa, Paul, Yu, Hao, He, Lei |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2012
|
Online Access: | https://hdl.handle.net/10356/94322 http://hdl.handle.net/10220/8742 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
STEINER PROBLEM IN OCTILINEAR ROUTING MODEL
by: KOH CHENG KOK
Published: (2020) -
Variability-aware parametric yield estimation for analog/mixed-signal circuits : concepts, algorithms, and challenges
by: Shi, Yiyu, et al.
Published: (2015) -
Variability-aware parametric yield estimation for analog/mixed-signal circuits : concepts, algorithms and challenges
by: Gong, Fang, et al.
Published: (2014) -
ON THE STEINER CENTRE AND STEINER MEDIAN OF GRAPHS
by: CHEN YINXIU
Published: (2021) -
ON STEINER DISTANCE AND STEINER NUMBER OF A GRAPH
by: LUI XIANG YUN
Published: (2021)