| Summary: | 碩士 === 國立清華大學 === 資訊工程學系所 === 107 === Routing is a very important procedure in the IC design flow. As feature size in VLSI design continues to shrink, more and more complex design rules need to be considered during the routing phase. Typically, the routing problem can be divided into two stages due to the problem complexity: global routing, and detailed routing. A modern routing flow inserts one more method, track assignment, in the beginning of the detailed routing stage.
Inspired by the ISPD 2018 Contest Initial Detailed Routing, we propose an initial detailed routing approach based on track assignment, which also fully connects each net by using a Steiner tree algorithm. We evaluate our routing by a commercial tool to demonstrate the effectiveness of our routing approach.
|
|---|
