A Multilevel Routing Algorithm for Crosstalk minimization

• Main Authors: Yu-Rung Huang, 黃于容
• Other Authors: Mely Chen Chi
• Format: Others
• Language: zh-TW
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/t8e263

碩士 === 中原大學 === 資訊工程研究所 === 91 === Abstract Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue. In this paper, we will consider the relationship between neighboring parallel wires and crosstalk effect in our routing algorithm. In our global route, we adopt the probability to estimate the routing probability of global route of all design and calculate the congestions in order to disperse the global route of all nets. In detail route, we use the traditional maze search route algorithm and add the cost of neighboring parallel wire length. We first deal with the global nets that may cause the longest neighboring parallel wires. And then we use a multilevel routing method to route the remained nets. Finally, we complete the whole routing system. In the routing phase, we first deal with the portion that covers more Global nets of all nets. In the global route phase, we use the probability and congestions to disperse the routing. In the detail route phase, we take the neighboring parallel wire length cost into account. The extensive computer simulation shows that the neighboring parallel wire length is improved in our routing result exactly. In the experimental flow, we use the real circuit case as our input, and integrate with commercial CAD design flow.