A wire segment reassignment algorithm for minimizing crosstalk for strait-type river routing

Author

Cherng, Jong-Sheng ; Chen, Sao-Jie

Author_Institution

Dept. of Electr. Eng., Da Yeh Univ., Changhwa, Taiwan

Volume

3

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

1305

Abstract

In this paper, an effective algorithm is proposed to generate crosstalk-reduced routing solutions, where nonmonotonic routing is allowed, for the gridded strait-type river routing (STRR) problem. Given an initial routing solution generated by a conventional STRR algorithm, the reduction of crosstalks is carried out by the reassignment of the horizontal and vertical wire segments. Besides minimizing crosstalks, the minimization of the number of jogs is also considered in the reassignment process for performance promotion. To effectively and optimally perform the reassignment process, an integer linear programming (ILP) formulation is proposed. The experimental results show that this approach of ILP is very encouraging

Keywords

circuit layout CAD; crosstalk; integer programming; integrated circuit layout; linear programming; minimisation; network routing; ILP formulation; STRR algorithm; VLSI design; crosstalk minimization; crosstalk-reduced routing algorithm; gridded strait-type river routing; horizontal/vertical wire segment reassignment; integer linear programming; nonmonotonic routing; performance promotion; reassignment process; strait-type river routing; wire segment reassignment algorithm; Crosstalk; Degradation; Frequency; Integer linear programming; Mesh generation; Minimization; Rivers; Routing; VHF circuits; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on

Print_ISBN

0-7803-7057-0

Type

conf

DOI

10.1109/ICECS.2001.957455

Filename

957455