UCSC-CRL-98-09: OPTIMAL WIRE SPACING UNDER CROSS TALK CONSTRAINTS

08/01/1998 09:00 AM
Computer Engineering
As VLSI technology continues to advance, the spacing between adjacent wires continues to decrease, causing a corresponding increase in capacitive coupling between adjacent wires. This trend makes it increasingly likely that we will generate routings which violate one or more of the noise margins on the net\'s sink pins. At the same time, these technologies are becoming more routing limited. These two trends are increasingly forcing physical designers to use scarce routing resources to decrease the coupling between adjacent wires. From this we can see that what is needed is a set of tools, applicable in an area routing environment, that will generate routings that meet all the noise constraints while sacrificing the minimum amount of routing resources. In this paper we will present a polynomial time algorithm, which can be used in an area routing environment, for determining the optimal spacing between a victim net and it\'s adjacent aggressor nets such that none of the noise margins of the victim net\'s sink pins are violated, while consuming the minimum amount of routing resources.

UCSC-CRL-98-09