| Summary: | 碩士 === 國立清華大學 === 資訊工程學系所 === 107 === Routing plays an important role in modern VLSI design. It traditionally consists of two stages: global routing and detailed routing. To reduce the complexity of detailed routing, a track assignment procedure is sometimes adopted. Since detailed routing becomes much more complicated in recent years, we can further divide it into two steps: initial detailed routing and detailed routing refinement. In this thesis, we propose a rip-up-and-reroute-based refinement method following a track-assignment-based initial detailed routing algorithm. A patch attachment method is also performed to reduce design rule violations. The experimental results show that our refinement methods can improve the solution quality for a track-assignment-based initial detailed routing result. Moreover, compared with the top 2 teams of the ISPD 2018 Initial Detailed Routing Contest, we obtain the best average ranking.
|
|---|
