Sciweavers

4 search results - page 1 / 1
» FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal T...
Sort
View
TCAD
2008
119views more  TCAD 2008»
13 years 4 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
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
13 years 10 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
13 years 11 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
13 years 8 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang