An optimal algorithm for river routing with crosstalk constraints

With the increasing density of VLSI circuits, the interconnection wires are getting packed even closer. This has increased the effect of interaction between these wires on circuit performance and hence, the importance of controlling crosstalk. In this paper, we consider river routing with crosstalk constraints. Given the positions of the pins in a single-layer routing channel and the maximum tolerable crosstalk between each pair of nets, we give a polynomial time algorithm to decide whether there is a feasible river routing solution and produce one with minimum crosstalk whenever the problem is feasible.

[1]  H. B. Bakoglu,et al.  Circuits, interconnections, and packaging for VLSI , 1990 .

[2]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[3]  C. L. Liu,et al.  Minimum crosstalk channel routing , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Martin D. F. Wong,et al.  An optimal layer assignment algorithm for minimizing crosstalk for three layer VHV channel routing , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[5]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[6]  A.L. Sangiovanni-Vincentelli,et al.  Techniques For Crosstalk Avoidance In The Physical Design Of High-performance Digital Systems , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[7]  Tong Gao,et al.  Minimum Crosstalk Switchbox Routing , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[8]  Ernest S. Kuh,et al.  A spacing algorithm for performance enhancement and cross-talk reduction , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

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