A Novel Multilayer Gridless Detailed Routing Method
Based on a non-uniform-grid graph model, a self-adaptive iterative algorithm is presented for multi-layer gridless area routing. The algorithm can not only handle the case in which the number of metal layers is uncertain, but also greatly reduce the search space of multi-layer maze routing by converting multi-layer into multiple two-layer pairs. General speaking, the maze routing is slow. In order to accelerate checking the routing feasibility of a point in maze routing,an improved binary internal tree is introduced to manage routing obstacles, by which the comparison times are reduced.
Non-uniform-grid Gridless Routing Binary Internal Tree Detailed Routing, And Global Routing
Mande Xie
College of Computer Science & Information Engineering, Zhejiang Gongshang Univ.HangZhou, Zhejiang 310035, P.R.China
国际会议
杭州
英文
222-225
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）