用改进激活集合法优化VLSI互连线  

Optimizate VLSI Wire by Modified Active Set Method

作　　者：刘颖[1] 翁健杰[1] 戎蒙恬[1] 

机构地区：[1]上海交通大学电子工程系,上海200030

出　　处：《微电子学与计算机》2004年第12期203-206,共4页Microelectronics & Computer

基　　金：国家863计划项目资助(863SOCY332)

摘　　要：本文介绍离散线宽的单根互连线时延优化的一种算法:改进激活集合法(MASM)。基于Elmore时延模型,单根互连线的优化问题能被表述为凸二次规划,能在多项式时间里求解,得到最优结果。它是一种非常高效的算法,计算结果证明了此算法的有效性。In this paper, we introduce a algorithm, approach to the problem of delay minimization for a wire of discrete choices of wire width: Modified Active Set Method(MASM). Based on the Elmore delay model, the problem for wire sizing for a wire can be formulated as a convex quadratic program, which is known to be solvable in polynomial time and derive an optimal solution. It is a very efficient algorithm. The effectiveness of the algorithm is proved by the calculate result.

关 键 词：互连线时延 凸二次规划 优化 

分 类 号：TN47[电子电信—微电子学与固体电子学] TN305.96