Efficient Obstacle-Avoiding Octagonal Steiner Tree Construction

• Main Authors: Zhe-ming Ho, 何哲名
• Other Authors: De-Sheng Chen
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/10460795255431548192

碩士 === 逢甲大學 === 資訊工程所 === 96 === With manufacture improvement, the same feature size could have more transistors than before. The design becomes more complex, and the timing delay problem is even more crucial. In chip design, the routing problem plays an important role of the IC performance. Effective algorithms to reduce total wirelength become very critical and necessary for IC design. This study is to propose a new algorithm to construct X-architecture steiner tree. The algorithm not only reduces total wire length but also lowers timing delay problem. This method is different from traditional Rectilinear-steiner tree construction style that it considers not only horizontal and vertical direction, but also 45 and 135 degree routing. This study has three steps: 1. Construct Obstacle-Avoiding spanning graph. 2. Transform the spanning graph into spanning tree by Prim’s algorithm.3. Efficient obstacle-avoiding octagonal steiner tree construction method is utilized to transform the spanning tree to X-architecture Steiner tree. Though the algorithm used might result in long time than other methods, but it reduce total wire length than other papers.