Fast obstacle-avoiding octilinear steiner minimal tree construction algorithm for VLSI design

With advance in manufacturing technology, 45° and 135° diagonal segments can be permitted in an octilinear routing model. In this article, we present a heuristic algorithm to solve obstacle-avoiding octilinear Steiner minimal tree (OAOSMT) construction problem. We first construct an obstacle-free Euclidean minimal spanning tree (OFEMST). Then two lookup tables about OFEMST's edge are generated, which can provide fast information inquiry for subsequent steps. Next, an obstacle-avoiding strategy is proposed to convert OFEMST into an obstacle-avoiding octilinear Steiner tree (OAOST). Finally, we design an excellent refinement technique, which can further reduce the wirelengh. Experiments show that both wirelengh and runtime of our algorithm are the best compared to the previous algorithms.

[1]  Liang Li,et al.  Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach , 2014, Integr..

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  Hai Zhou,et al.  EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[5]  Hai Zhou,et al.  Spanning graph-based nonrectilinear steiner tree algorithms , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[7]  Chris C. N. Chu,et al.  FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction , 2011, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Shu-Ping Chang,et al.  Timing-driven non-rectangular obstacles-avoiding routing algorithm for the X-architecture , 2009 .

[9]  Jin-Tai Yan.  Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction , 2008, TODE.

[10]  Guolong Chen,et al.  A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction , 2015, Soft Comput..

[11]  Steven L. Teig,et al.  The X architecture: not your father's diagonal wiring , 2002, SLIP '02.

[12]  Yu Hu,et al.  lambda-OAT: lambda-Geometry Obstacle-Avoiding Tree Construction With O(nlog n) Complexity , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..