Please use this identifier to cite or link to this item:
|Title:||Algorithms for Reducing Crosstalk in Two-Layer Channel Routing|
Datta, Alak K.
Mandal, Tarak N.
Pal, Rajat K.
|Keywords:||Channel routing problem|
Simplest channel instance
High performance routing
|Publisher:||Vidyasagar University , Midnapore , West-Bengal , India|
|Series/Report no.:||Journal of Physical Science;Vol 10 |
|Abstract:||Crosstalk minimization is one of the most important high performance aspects in interconnecting VLSI circuits. With advancement of fabrication technology, devices and interconnecting wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Crosstalk minimization problem for the reserved two-layer Manhattan channel routing is NP-hard, even if the channel instances are free from any vertical constraint (simplest channel instances). In this paper we have developed heuristic algorithms for computing reduced crosstalk two-layer channel routing solutions for simplest as well as general channel instances. In general, the results obtained are highly encouraging.|
|Appears in Collections:||Journal of Physical Sciences Vol.10 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.