{"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}
引用次数: 5
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
