| Home | Organizers | Proceedings Editors | Proceedings Contributors | Search | | ||
|
|
|||
|
||||
|
|
||||
| Title: | REDUCING CROSSING NUMBER OF MULTI-COLOR RECTILINEAR STEINER TREES USING MONOCHROMATIC PARTITIONING | |
| DOI No: | 10.1142/9781860948534_0011 | |
| Source: | INNOVATIVE APPLICATIONS OF INFORMATION TECHNOLOGY FOR THE DEVELOPING WORLD (pp 73-77) | |
| Author(s): | S. MAJUMDER
IIIT, Kolkata 700 091, India B. B. BHATTACHARYA ISI, Kolkata 700 108, India S. M. A. JAFRI IIIT, Kolkata 700 091, India |
|
| Abstract: | For wire routing in VLSI design, often the terminals belonging to the same net need to be connected electrically using conducting paths. To minimize wire-length, for each net, the connecting paths may together comprise of either a geometric minimum spanning tree or a rectilinear Steiner tree in case of manhattan routing. If we mark the trees for distinct nets with different colors, then a common goal in global routing is to minimize the number of crossings between the edges of different colors. This reduces the number of vias required and thus helps in better utilization of the metal layers. In this paper, we have proposed a fast and novel technique to do the same. The experimental results obtained are quite encouraging. | |
| Full Text: | View full text in PDF format (253KB) | |
| TOC: | Back to Table of Contents | |
|
||