A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model
ASP-DAC '06 Proceedings of the 2006 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
Circuit simulation based obstacle-aware Steiner routing
Proceedings of the 43rd annual Design Automation Conference
Efficient obstacle-avoiding rectilinear steiner tree construction
Proceedings of the 2007 international symposium on Physical design
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Preferred direction Steiner trees
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
High-performance obstacle-avoiding rectilinear steiner tree construction
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection
Proceedings of the 2009 International Conference on Computer-Aided Design
Efficient multi-layer obstacle-avoiding preferred direction rectilinear Steiner tree construction
Proceedings of the 16th Asia and South Pacific Design Automation Conference
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction
Proceedings of the 49th Annual Design Automation Conference
Hi-index | 0.00 |
In IC design, rectilinear Steiner trees have been used to route signal nets by global and detail routers for a long time. Recently, there are more complicated processing conditions for routing to be considered, such as multiple routing layers, obstacles, and preferred directions. Furthermore, routability is also an important issue for modern routing which handles more than ten thousand signal nets. As a result, how to meet the processing conditions and consider the routability at the same time is becoming important. In this paper, we formulate a routing problem, called the obstacle-avoiding preferred direction Steiner tree (OAPDST) problem, which can deal with more practical processing conditions and achieve acceptable routability. To the best of our knowledge, this is the first attempt to formulate this problem. Then, we propose a routing graph, called preferred direction evading graph (PDEG), for this problem, and prove that at least one optimal solution can be found on PDEG. As a result, by using PDEG as the solution space, more efficient and effective methods can be found for the OAPDST problem. Based on PDEG, we also construct an approximation algorithm for the OAPDST problem to provide stable and effective solutions. Experimental results show that our method can perform well for the OAPDST problem