An efficient rectilinear Steiner tree algorithm with obstacles

Authors:
Hsin-Hsiung Huang;Hui Yu Huang;De-Jing Huang;Tsai-Ming Hsieh
Affiliations:
Institute of Electronic Engineering, Chung Yuan Christian University, Chung-Li, Taiwan, R.O.C.;Department of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, Taiwan, R.O.C.;Department of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Taitung University, Taitung, Taiwan, R.O.C.
Venue:
CSECS'06 Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing
Year:
2006

Citing 7
Cited 1

Routing tree construction under fixed buffer locations

Proceedings of the 37th Annual Design Automation Conference
Refined single trunk tree: a rectilinear steiner tree generator for interconnect prediction

SLIP '02 Proceedings of the 2002 international workshop on System-level interconnect prediction
Fast maze router

DAC '78 Proceedings of the 15th Design Automation Conference
Efficient Rectilinear Steiner Tree Construction with Rectilinear Blockages

ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Highly scalable algorithms for rectilinear and octilinear Steiner trees

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane

Proceedings of the 2006 international symposium on Physical design
Efficient Steiner tree construction based on spanning graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A multi-layer obstacles-avoiding router using X-architecture

WSEAS Transactions on Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents the algorithm which constructs the Steiner tree in the presence of the obstacles. Two accomplishments which one effectively finds the result and the other efficiently obtains the solution are proposed in this study. The first proposed method connects the pins with obstacles using the spanning graph. At the first stage, the spanning graph is constructed by the given pins and the four corner points of the obstacles. At the second stage, the searching algorithm is performed to find a sub-graph, the spanning tree, and transform the spanning tree into a rectilinear Steiner tree at the third stage. The second proposed method which first builds a routing tree without the obstacles and then removes the intersection edge obtains efficiently the routing result. The objective of the problem, which is solved in this paper, is to minimize the total wire-length. Compared with the total wirelength without the obstacles, it shows experimentally that the graph-based algorithm can obtain the routing solution with only 1.26% extra total wire-length in the presence of obstacles. As to the two-stage heuristic method, it obtains on average 190000 × speedup over while takes the 6.4% extra total wirelength.