首页> 外文会议>2011 International Conference on System Science, Engineering Design and Manufacturing Informatization >The automation design based on graphs for the symmetrical routing in integrated circuit
【24h】

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 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.
机译:通道路由是VLSI布局领域的关键问题。 Szymanski证明寻找信道路由的最小宽度解决方案是NP-hard的。在本文中,我们得出的结论是,$ CCG $的最小并行团覆盖量等于两层曼哈顿通道路由的最优解,其中垂直约束是非循环的,并且不允许多余的空列和狗腿。在此基础上,我们还提出了一种新的启发式算法,以解决2层曼哈顿通道路由问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号