DocumentCode :
2225341
Title :
Minimum crosstalk channel routing with dogleg
Author :
Hsu, Kuo-Chih ; Lin, Yu-Chung ; Chiu, Po-Xun ; Hsieh, Tsai-Ming
Author_Institution :
Dept. of Inf. & Comput. Eng., Chung Yuan Christian Univ., Chung Li, Taiwan
Volume :
3
fYear :
2000
fDate :
2000
Firstpage :
73
Abstract :
In this paper, we present an approach to the gridded channel routing problem with the objectives of satisfying crosstalk constraints on the nets and minimizing the total crosstalks among all of the nets. Given an initial routing solution generated by a conventional channel routing algorithm, the reduction of crosstalks is carried out by the reassignment of the horizontal wire segments. In order to further reduce the crosstalks, doglegs are allowed for some specified wire segments. To effectively and optimally perform the reassignment process, an integer linear programming (ILP) formulation is proposed. Experimental results show that our algorithm can improve the minslack and the total crosstalks significantly compared with the track permutation approach and the segment reassignment approach
Keywords :
VLSI; circuit layout CAD; crosstalk; integer programming; integrated circuit layout; linear programming; network routing; ILP formulation; VLSI layout; crosstalk constraints; dogleg; gridded channel routing problem; horizontal wire segments reassignment; integer linear programming; minimum crosstalk channel routing; Capacitance; Coupling circuits; Crosstalk; Delay; Fabrication; Integer linear programming; Integrated circuit interconnections; Routing; Very large scale integration; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
Conference_Location :
Geneva
Print_ISBN :
0-7803-5482-6
Type :
conf
DOI :
10.1109/ISCAS.2000.855999
Filename :
855999
Link To Document :
بازگشت