By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Xu Zhenghua ; Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fujian 350002, China

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.

Published in:

System Science, Engineering Design and Manufacturing Informatization (ICSEM), 2011 International Conference on  (Volume:2 )

Date of Conference:

22-23 Oct. 2011