Fast vectorless power grid verification using an approximate inverse technique

Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an early verification approach under the framework of current constraints where worst-case node voltage drops are computed via linear programs proportional to the grid size. We propose an efficient method based on a sparse approximate inverse technique to greatly reduce the size of such linear programs while ensuring a user-specified over-estimation margin (in volts) on the exact solution.

[1]  Marcus J. Grote,et al.  Parallel Preconditioning with Sparse Approximate Inverses , 1997, SIAM J. Sci. Comput..

[2]  Farid N. Najm,et al.  Power grid voltage integrity verification , 2005, ISLPED '05. Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005..

[3]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[4]  William F. Moss,et al.  Decay rates for inverses of band matrices , 1984 .

[5]  Farid N. Najm,et al.  A static pattern-independent technique for power grid voltage integrity verification , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[6]  Eli Chiprout Fast flip-chip power grid analysis via locality and grid shells , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[7]  Farid N. Najm,et al.  A geometric approach for early power grid verification using current constraints , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.