Sciweavers

30 search results - page 2 / 6
» Efficient obstacle-avoiding rectilinear steiner tree constru...
Sort
View
ISPD
2007
ACM
82views Hardware» more  ISPD 2007»
13 years 7 months ago
Efficient obstacle-avoiding rectilinear steiner tree construction
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
13 years 4 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young
TCAD
2008
119views more  TCAD 2008»
13 years 6 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
VLSID
2002
IEEE
109views VLSI» more  VLSID 2002»
14 years 6 months ago
Probabilistic Analysis of Rectilinear Steiner Trees
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
Chunhong Chen
ASPDAC
2005
ACM
158views Hardware» more  ASPDAC 2005»
13 years 8 months ago
The polygonal contraction heuristic for rectilinear Steiner tree construction
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...