- 學位論文
最小化串音效應之多階層式繞線方法
A Multilevel Routing Algorithm for Crosstalk minimization
摘要
中文摘要 在現今深次微米的設計中，由於半導體元件設計所要求的面積越來越小在內部所要求的頻率切換也越來越快，crosstalk在導線與導線間的所形成效應在超大型積體電路的設計便成為一個很重要的議題。在本篇論文中，我們在整個繞線的演算法中考慮相鄰平行導線與crosstalk效應所產生的正比關係，避免繞線時crosstalk的效應。我們在Global繞線中，採用機率的估算與擁擠度的估計，分散在Global繞線時的所決定的繞線。而在Detail繞線中，我們則在傳統的maze繞線演算法中，加入detail繞線時所形成相鄰平行線段的繞線成本。在整個繞線的系統中，我們預先處理所可能形成較長平行線段的global nets，而尚未處理的nets則以一個多階層式的繞線方式，最後完成整個繞線系統。 實驗的結果可以發現，在處理繞線的階段時，先行處理部分在整體晶片上含括範圍較大的Global nets，並在Global繞線時分散所形成的繞線，以及在Detail繞線時，考量相鄰平行線段的成本，便可以對整體繞線的結果中所形成的相鄰平行線段的確得到一個大幅度的改進。而在實驗流程的部分，我們使用實際的電路作為我們的實驗輸入，並且能夠跟現有的CAD設計流程作整合，讓本論文更具實用性。
並列摘要
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.