王雨田-计算机辅助设计与图形学学报.PDFVIP

第28 卷 第 11 期 计算机辅助设计与图形学学报 Vol. 28 No.11 2016 年 11 月 Journal of Computer-Aided Design Computer Graphics Nov. 2016 考虑设计规则的引脚分配算法 * 王雨田, 贾小涛, 蔡懿慈 , 周 强 (清华大学计算机科学与技术系 北京 100084) (caiyc@mail.tsinghua.edu.cn) : 详细布线是集成电路物理设计的关键步骤之一, 引脚分配是影响详细布线质量和减少设计规则违反的关键 因素, 为此提出一种基于最小费用最大流的考虑设计规则的引脚分配算法. 首先构建详细布线图和相应的网格图; 然后在网格图上搜索布线区域内总费用最小的最大流, 为所有线网的引脚同时分配pin 点; 在引脚分配的基础上提出 一种拆线重布算法，针对引脚分配中不合理的pin 点位置进行拆线重布, 为其分配新的pin 点, 同时对设计规则违反 从代价函数定义、拆线重布顺序、布线方式 3 个方面进行优化. 实验结果表明, 应用文中的引脚分配算法后, 详细布 线结果中的设计规则违反数平均减少了24%. ：详细布线; pin 点分配; 拆线重布 ：TP302.1 DRC-aware Pin Access Planning for Detailed Routing * Wang Yutian, Jia Xiaotao, Cai Yici , and Zhou Qiang (Department of Computer Science and Technology, Tsinghua University, Beijing 100084) Abstract: Detailed routing is one of the key steps in integrated circuit physical design. Pin access planning is a key factor affecting the quality of detailed routing result and reducing design rule check (DRC) violations. A pin access planning algorithm based on minimum cost maximum flow (MCMF) and taking DRC violations into ac- count is proposed. Firstly, it constructed detailed routing graph and corresponding grid graph. Then, all the pin access positions were assigned by searching MCMF of the routing area on the grid graph. On the basis of the above pin access planning algorithm, a rip-up and rerouting algorithm is proposed. New pin access positions were reassigned for the unreasonable ones when ripping-up and rerouting. DRC violation was taken into account as well. Algorithm was optimized with three aspects: the definition of cost function, the order of ripping-up and re- routing and the routing method. Experimental result