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

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.