Power grid sizing via convex programming

With the technology scaling and supply voltage reduction, designing a robust on-chip power network has become a challenging problem. In this paper, we devise a power grid sizing method to optimize the worst IR drop without explicitly deriving the current distribution. The method reduces the sizing problem into an effective resistance optimization problem which can be solved by convex programming efficiently. Experimental results show that our method can achieve up to 40% improvement for 2D grids and 7.32% improvement for a four-layer power grid.

[1]  Charlie Chung-Ping Chen,et al.  Optimization of the power/ground network wire-sizing and spacing based on sequential network simplex algorithm , 2002, Proceedings International Symposium on Quality Electronic Design.

[2]  Stephen P. Boyd,et al.  Design of robust global power and ground networks , 2001, ISPD '01.

[3]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[4]  Malgorzata Marek-Sadowska,et al.  On-chip power-supply network optimization using multigrid-based technique , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Stephen P. Boyd Convex optimization of graph Laplacian eigenvalues , 2006 .

[6]  Michael Chertkov,et al.  A majorization-minimization approach to design of power transmission networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[7]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[8]  Puneet Gupta,et al.  Efficient design and analysis of robust power distribution meshes , 2006, 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06).

[9]  Stephen P. Boyd,et al.  Optimizing dominant time constant in RC circuits , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..