Global routing with crosstalk constraints

  • Authors:
  • Hai Zhou;D. F. Wong

  • Affiliations:
  • Department of Computer Sciences, University of Texas, Austin, TX;Department of Computer Sciences, University of Texas, Austin, TX

  • Venue:
  • DAC '98 Proceedings of the 35th annual Design Automation Conference
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. W e present a global routing algorithm based on a new Steiner tree formulation and the Lagrangian relaxation technique. W e also give theoretical results on the complexity of the problem.