{"title":"The 60 degrees grid : routing channels in width d/ square root 3","authors":"K. D. Powers, D. J. Brown, M. Brady","doi":"10.1109/GLSV.1991.143968","DOIUrl":null,"url":null,"abstract":"The 60 degrees grid consists of vertical columns and diagonal tracks running at slopes of +or-30 degrees . This model offers a potentially large reduction in channel width, without resorting to wire overlap. For a channel routing problem with density d, the availability of the diagonal tracks leads to a lower bound of d/ square root 3. The authors present two near-optimal channel routing algorithms. The first uses 5 layers and always routes in width at most d/ square root 3+ square root 3. The second algorithm uses at most 4 layers and routes in width omega , where d/ square root 3+O(1)<or= omega <or=d/ square root 3+O( square root d).<<ETX>>","PeriodicalId":261873,"journal":{"name":"[1991] Proceedings. First Great Lakes Symposium on VLSI","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. First Great Lakes Symposium on VLSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLSV.1991.143968","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The 60 degrees grid consists of vertical columns and diagonal tracks running at slopes of +or-30 degrees . This model offers a potentially large reduction in channel width, without resorting to wire overlap. For a channel routing problem with density d, the availability of the diagonal tracks leads to a lower bound of d/ square root 3. The authors present two near-optimal channel routing algorithms. The first uses 5 layers and always routes in width at most d/ square root 3+ square root 3. The second algorithm uses at most 4 layers and routes in width omega , where d/ square root 3+O(1)>