多电源配电网络的布线与优化

Routing and Optimization of Multiple Power Distribution Networks

随着集成电路的发展,多个电源为不同高度/宽度的IP模块供电的情形越来越常见。为了减少布线资源,同时满足IP模块所给定的电压降限制,保证电路稳健性。本文提出一种针对多电源配电网络的布线与优化算法。算法分为三部分:首先构建布线通道,然后使用修改的Dijkstra算法搜索引脚和压焊块之间的最短路径,最后用拉格朗日乘子法对线宽进行迭代优化。该算法运算速度很快,同时消耗很小的内存。

With the development of integrated circuits,it is becoming more common for multiple power supplies to supply IP modules of different heights/widths.In order to reduce the wiring resources,and at the same time meet the voltage drop limit given by the IP module,the circuit is guaranteed to be robust.This paper proposes a routing and optimization algorithm for multi-power distribution networks.The algorithm is divided into three parts:firstly construct the routing channel,then use the modified Dijkstra algorithm to search for the shortest path between the pin and the pad,and finally iteratively optimize the line width by the Lagrangian multiplier method.The algorithm is fast and consumes very little memory.