Global routing with crosstalk constraints

Due to the scaling down of device geometry and increasing frequency in deep sub-micron designs, crosstalk between interconnection wires has become an important issue in VLSI layout design. In this paper, we consider crosstalk avoidance during global routing. We present a global routing algorithm based on a new Steiner tree formulation and the Lagrangian relaxation technique. We also give theoretical results on the complexity of the problem.

[1]  C. L. Liu,et al.  Minimum crosstalk switchbox routing , 1994, ICCAD.

[2]  Hai Zhou,et al.  Crosstalk-constrained maze routing based on Lagrangian relaxation , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[3]  Dongsheng Wang,et al.  Post global routing crosstalk risk estimation and reduction , 1996, Proceedings of International Conference on Computer Aided Design.

[4]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.

[5]  Dhanistha Panyasak,et al.  Circuits , 1995, Annals of the New York Academy of Sciences.

[6]  T. Sakurai,et al.  Simple formulas for two- and three-dimensional capacitances , 1983, IEEE Transactions on Electron Devices.

[7]  Hai Zhou,et al.  An optimal algorithm for river routing with crosstalk constraints , 1996, ICCAD 1996.

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  C. L. Liu,et al.  Minimum crosstalk channel routing , 1993, ICCAD.

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

[11]  Ernest S. Kuh,et al.  A spacing algorithm for performance enhancement and cross-talk reduction , 1993, ICCAD.

[12]  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.

[13]  Alberto L. Sangiovanni-Vincentelli,et al.  Techniques for crosstalk avoidance in the physical design of high-performance digital systems , 1994, ICCAD.

[14]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .