Cross Point Assignment Algorithm with Crosstalk Constraint  

串扰噪声约束下的过点分配算法(英文)

作　　者：姚海龙[1] 周强[1] 洪先龙[1] 蔡懿慈[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《Journal of Semiconductors》2004年第4期388-393,共6页半导体学报（英文版）

基　　金：国家高技术研究与发展计划 (批准号 :2 0 0 2 AA1Z14 60 ) ;国家自然科学基金 (批准号 :60 1760 16);高等学校博士学科点专项科研基金 (批准号 :2 0 0 2 0 0 0 3 0 0 87)资助项目~~

摘　　要：An algorithm to resolve the coupling effect problem is proposed during the cross point assignment (CPA) stage.In the algorithm,the priority queue concept and the rip-up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance.First,the nets are arranged into different priority queues according to their weighted sum of their length and criticality.Then,the CPA problem for one queue of nets is translated into a linear assignment problem.After the assignment of one queue of nets,a post-CPA checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned.The algorithm is tested by a set of bench mark examples,and the experimental results are promising...提出了一种在过点分配阶段解决噪声耦合效应问题的算法 .该算法采用优先队列同拆线重布策略相结合的方法 ,控制由互连线耦合电容引起的串扰噪声 .算法中 ,首先按照线长和约束限制 ,将线网划分到若干个优先队列中 .然后 ,将每个优先队列的过点分配问题转换为线性分配问题 .在完成一个线网队列的分配后 ,通过过点分配后处理过程检查串扰约束满足情况 ,对违反约束的线网对进行拆除 ,放入后续线网队列进行重新分配 .实验数据表明 。

关 键 词：routing cross point assignment CROSSTALK INTERCONNECT 

分 类 号：TN402[电子电信—微电子学与固体电子学]