vh . . vh多层通道路由

[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

{"title":"vh . . vh多层通道路由","authors":"Jee-Soo Lee, Yookun Cho","doi":"10.1109/ISVD.1991.185130","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":183602,"journal":{"name":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"HVH. . .VH multi-layer channel routing\",\"authors\":\"Jee-Soo Lee, Yookun Cho\",\"doi\":\"10.1109/ISVD.1991.185130\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":183602,\"journal\":{\"name\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.1991.185130\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.1991.185130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

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

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

查看原文本刊更多论文

HVH. . .VH multi-layer channel routing

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量