Minimum crosstalk channel routing

As technology advances, interconnection wires are placed in closer proximitg and circuits operate at higher frequencies. Consequently, reduction of crosstalk-s between interconnection wires becomes an important consideration in VLSI design. In this paper, we study the gm’dded channel routing problem with the objective of satisfying crosstalk constraints for the nets. We propose a new approach which utilizes extstzng channel routing algorithms and improves upon the routing results by permuting the routing tracks. A novel mixed ILP formulation and effective procedures for reducing the number of variables and constraints in the mixed ILP formulation are then presented. The experimental results are encouraging.

[1]  Michael Burstein,et al.  Hierarchical channel router , 1984 .

[2]  Wayne Wei-Ming Dai,et al.  Rubber band routing and dynamic data representation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[3]  Martin D. F. Wong,et al.  Compacted channel routing with via placement restrictions , 1986, Integr..

[4]  Jason Cong,et al.  A new approach to three- or four-layer channel routing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  H. H. Chen,et al.  Wiring And Crosstalk Avoidance In Multi-chip Module Design , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.