串音驱动的路由资源分配

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512) Pub Date : 2004-05-23 DOI:10.1109/ISCAS.2004.1329465

Hailong Yao, Qiang Zhou, Xianlong Hong, Yici Cai

{"title":"串音驱动的路由资源分配","authors":"Hailong Yao, Qiang Zhou, Xianlong Hong, Yici Cai","doi":"10.1109/ISCAS.2004.1329465","DOIUrl":null,"url":null,"abstract":"Crosstalk noise is one of the emerging issues in deep submicrometer technology which causes many undesired effects on the circuit performance. In this paper, a CDRRA algorithm, which integrated the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage, is proposed. The CDRRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max-clique of the graph. Then the nets in each max-clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested by a set of bench mark examples and experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.","PeriodicalId":6445,"journal":{"name":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","volume":"26 1","pages":"V-V"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Crosstalk driven routing resource assignment\",\"authors\":\"Hailong Yao, Qiang Zhou, Xianlong Hong, Yici Cai\",\"doi\":\"10.1109/ISCAS.2004.1329465\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Crosstalk noise is one of the emerging issues in deep submicrometer technology which causes many undesired effects on the circuit performance. In this paper, a CDRRA algorithm, which integrated the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage, is proposed. The CDRRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max-clique of the graph. Then the nets in each max-clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested by a set of bench mark examples and experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.\",\"PeriodicalId\":6445,\"journal\":{\"name\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"volume\":\"26 1\",\"pages\":\"V-V\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAS.2004.1329465\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2004.1329465","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

串扰噪声是深亚微米技术中出现的新问题之一，它对电路性能产生了许多不良影响。本文提出了一种集成路由层和航迹的CDRRA算法，以解决航迹/层分配阶段的串扰噪声问题。将CDRRA问题表述为加权二部匹配问题，并采用线性分配算法求解。网络间的串扰风险用无向图表示，并发串扰风险网络的最大数量作为图的最大团。然后将每个最大团中的网分配到不相邻的轨道上。因此，基于团的概念可以避免串扰噪声。通过一组基准算例对该算法进行了测试，实验结果表明，该算法在不影响完成率的情况下，大大改善了最终的布线布局。

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

查看原文本刊更多论文

Crosstalk driven routing resource assignment

Crosstalk noise is one of the emerging issues in deep submicrometer technology which causes many undesired effects on the circuit performance. In this paper, a CDRRA algorithm, which integrated the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage, is proposed. The CDRRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max-clique of the graph. Then the nets in each max-clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested by a set of bench mark examples and experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.

求助全文

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

来源期刊

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)

自引率

0.00%

发文量