The automation design based on graphs for the symmetrical routing in integrated circuit

Channel routing is a key problem in the area of VLSI layout. Finding a minimum width solution of channel routing was proved to be NP-hard by Szymanski. In this paper, we come to a conclusion that the minimum parallel clique cover of CCG is equivalent to the optimal solution of 2-layer manhattan chan...

Full description

Saved in:
Bibliographic Details
Published in2011 International Conference on System science, Engineering design and Manufacturing informatization Vol. 2; pp. 331 - 334
Main Author Xu Zhenghua
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2011
Subjects
Channel routing
Graph
Manhattan model
Routing
VLSI
Online AccessGet full text

Cover

More Information
Summary:Channel routing is a key problem in the area of VLSI layout. Finding a minimum width solution of channel routing was proved to be NP-hard by Szymanski. In this paper, we come to a conclusion that the minimum parallel clique cover of CCG is equivalent to the optimal solution of 2-layer manhattan channel routing where vertical constrains are noncyclic and extra empty columns and doglegs are not allowed. We also gave a new heuristic algorithm based on the conclusion to solve the problem of 2-layer manhattan channel routing.
ISBN:1457702479
9781457702471
DOI:10.1109/ICSSEM.2011.6081312