Optimal river routing with crosstalk constraints
Authors:
Open Access
- 1 July 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 3 (3) , 496-514
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Techniques For Crosstalk Avoidance In The Physical Design Of High-performance Digital Systems1994
- Minimum Crosstalk Switchbox Routing1994
- Wiring And Crosstalk Avoidance In Multi-chip Module Design1992
- Combinatorial Algorithms for Integrated Circuit Layout1990
- One-layer routing without component constraintsJournal of Computer and System Sciences, 1984
- Optimal wiring between rectangles1981