Optimal river routing with crosstalk constraints

Hai Zhou, D. F. Wong

Research output: Contribution to journalArticlepeer-review


With the increasing density of VLSI circuits, the interconnection wires are being packed even closer. This has increased the effect of interaction among these wires on circuit performance and hence, the importance of controlling crosstalk. In this article, 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 neighboring nets, we give a polynomial time algorithm to decide whether there is a feasible river routing solution and produce one with minimum crosstalk when it is feasible.

Original languageEnglish (US)
Pages (from-to)496-514
Number of pages19
JournalACM Transactions on Design Automation of Electronic Systems
Issue number3
StatePublished - 1998
Externally publishedYes


  • Algorithms
  • Crosstalk
  • Design
  • Experimentation
  • Performance
  • River routing

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering


Dive into the research topics of 'Optimal river routing with crosstalk constraints'. Together they form a unique fingerprint.

Cite this