电源 /地线 ( P/G)拓扑结构的优化设计是超大规模集成电路 ( VLSI)中直接影响芯片性能的一个非常重要的问题 .通过对考虑可靠性及噪声的各项约束条件的分析 ,提出了一种时间复杂度为 O( N2m)基于最小代价生成树 ( MST)和改进的 Prim算法的快速构造算法 .实验结果表明 ,该算法在满足同样的性能约束条件下能有效地减小布线面积 Optimum design of power / ground (P / G) topology is a very important issue in VLSI that directly affects the performance of the chip.Based on the analysis of various constraints that consider reliability and noise, A fast construction algorithm based on minimum cost spanning tree (MST) and improved Prim algorithm with time complexity O (N2m) is presented.The experimental results show that the algorithm can effectively reduce the wiring area under the same performance constraints