HVH. . .VH multi-layer channel routing

[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design Pub Date : 1991-01-04 DOI:10.1109/ISVD.1991.185130

Jee-Soo Lee, Yookun Cho

引用次数: 0

Abstract

The authors present an algorithm for the HVH. . .VH multi-layer channel routing problem. First they determine the net groups to be positioned on the same track using a left-edge algorithm. The vertical constraint graph made from these net groups may contain many cycles. There is an attempt to remove the cycles through proper layer assignment and maze routing.<>

查看原文本刊更多论文

vh . . vh多层通道路由

提出了一种HVH多层信道路由问题的算法。首先，他们使用左边缘算法确定要放置在同一轨道上的网组。由这些网组组成的垂直约束图可能包含许多循环。有一种尝试通过适当的层分配和迷宫路由来移除循环

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design

自引率

0.00%

发文量