A gridless router based on hierarchical PB corner stitching structure

A multi-layer gridless area router is given in this paper. Based on corner stitching, this router adopts tile expansion to explore path for each net. A heuristic method that penalizes nodes deviating from the destination is devised to accelerate the algorithm. Besides, an enhanced interval tree is used to manage the intermediate data structure. In order to eliminate the effect that the routing order has on final results, a new gridless rip-up and rerouting algorithm is proposed. Test results indicate that the completion rate is improved after the rip-up and reroute process and the speed of this algorithm is satisfactory.

[1]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Jiri Soukup,et al.  Fast Maze Router , 1978, 15th Design Automation Conference.

[3]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[4]  John K. Ousterhout,et al.  Corner Stitching: A Data-Structuring Technique for VLSI Layout Tools , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  David Marple,et al.  Tailor: a layout system based on trapezoidal corner stitching , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..