Octilinear Steiner Trees Construction for Multi-layer X Routing with Obstacles

• Main Authors: Wei-Yung Wu, 吳維揚
• Other Authors: De-Sheng Chen
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/39662402744731870458

碩士 === 逢甲大學 === 資訊工程所 === 95 === Routing is an important phase in VLSI/CAD physical design. Recently, IC routing and related researches have been extended from Manhattan architecture to X-architecture to reduce wire length and cross talk efficiently. Given a set of terminals and a set of obstacles on multiple-layer, an obstacle avoiding octagonal Steiner minimal tree　(OSMT) connects these terminals, and avoids running through any obstacles in each layer to construct a tree with a minimal total wire length. This paper proposed a method to solve this problem. The approach can be divided into three steps. First, construct a spanning tree. Next, transform the spanning tree into a rectilinear Steiner tree. In the last step, translate the rectilinear Stenier tree into octilinear Steiner minimal tree. Experimental shows, our proposed approach is suitable for large amount of terminals and medium size of obstacles in a short time.