| Summary: | 碩士 === 國立臺灣大學 === 電子工程學研究所 === 97 === In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important problem in the physical design stage of VLSI circuits. Although this problem has attracted a lot of attentions in research and several approaches have been proposed to solve this problem effectively. But all the pervious works didn’t consider the diameter of the RSMT. Consider the critical path make the OARSMT more reasonable for time-driven circuits. In this paper, we develop an algorithm that combining Prim’s and Dijkstra’s algorithm to construct OARSMT balancing the wire length and radius for a better diameter. In our work, the experimental result shows that we do better in minimized the diameter of an OARSMT in most cases, but the wire length is close to double in worst case. For best case we can improve the diameter about 57% and average in 20.4% for those cases we truly have smaller diameter, for all cases we have improve in 14%.
|
|---|
