1-2-3路由算法或3互连层单通道2步路由器

W. Heyns
{"title":"1-2-3路由算法或3互连层单通道2步路由器","authors":"W. Heyns","doi":"10.1145/800263.809195","DOIUrl":null,"url":null,"abstract":"In this paper an algorithm is presented for the single channel routing on 3 interconnection layers. First some general characteristics of routing on 3 interconnection layers are presented. Then the specifications are introduced of the routing problem on 3 interconnection layers that will be considered. Pins will be allowed to come out on both the diffusion/poly layer and the second metal layer with the routing done on both the first and second metal layer. If only the first metal layer was to be used horizontally then the routing problem could be solved by a simple left-edge channel algorithm. However the 1-2-3 algorithm presented here will solve identical problems with a smaller number of tracks and via's since it makes use of some specific characteristics of routing on 3 interconnection layers.","PeriodicalId":290739,"journal":{"name":"19th Design Automation Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The 1-2-3 Routing Algorithm or the Single Channel 2-Step Router on 3 Interconnection Layers\",\"authors\":\"W. Heyns\",\"doi\":\"10.1145/800263.809195\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an algorithm is presented for the single channel routing on 3 interconnection layers. First some general characteristics of routing on 3 interconnection layers are presented. Then the specifications are introduced of the routing problem on 3 interconnection layers that will be considered. Pins will be allowed to come out on both the diffusion/poly layer and the second metal layer with the routing done on both the first and second metal layer. If only the first metal layer was to be used horizontally then the routing problem could be solved by a simple left-edge channel algorithm. However the 1-2-3 algorithm presented here will solve identical problems with a smaller number of tracks and via's since it makes use of some specific characteristics of routing on 3 interconnection layers.\",\"PeriodicalId\":290739,\"journal\":{\"name\":\"19th Design Automation Conference\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800263.809195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800263.809195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出了一种基于三层互连的单通道路由算法。首先介绍了三层互连路由的一般特点。然后介绍了将考虑的3个互连层的路由问题的规范。将允许引脚在扩散/聚层和第二金属层上出现,并在第一层和第二金属层上完成布线。如果只有第一层金属层是水平使用的,那么路由问题可以通过一个简单的左边缘信道算法来解决。然而,这里提出的1-2-3算法将用较少数量的轨道和通道来解决相同的问题,因为它利用了3个互连层上路由的一些特定特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The 1-2-3 Routing Algorithm or the Single Channel 2-Step Router on 3 Interconnection Layers
In this paper an algorithm is presented for the single channel routing on 3 interconnection layers. First some general characteristics of routing on 3 interconnection layers are presented. Then the specifications are introduced of the routing problem on 3 interconnection layers that will be considered. Pins will be allowed to come out on both the diffusion/poly layer and the second metal layer with the routing done on both the first and second metal layer. If only the first metal layer was to be used horizontally then the routing problem could be solved by a simple left-edge channel algorithm. However the 1-2-3 algorithm presented here will solve identical problems with a smaller number of tracks and via's since it makes use of some specific characteristics of routing on 3 interconnection layers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信