Dual Algorithms for Vectorless Power Grid Verification Under Linear Current Constraints

Authors:
Xuanxing Xiong;Jia Wang
Affiliations:
Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, IL, USA;Department of Electrical and Computer Engineering, Illinois Institute of Technology, Chicago, IL, USA
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2011

Citing 0
Cited 3

Vectorless verification of RLC power grids with transient current constraints

Proceedings of the International Conference on Computer-Aided Design
Overview of vectorless/early power grid verification

Proceedings of the International Conference on Computer-Aided Design
Constraint abstraction for vectorless power grid verification

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.03

Visualization

Abstract

Vectorless power grid verification makes it possible to evaluate worst-case voltage noises without enumerating possible current waveforms. Under linear current constraints, the vectorless power grid verification problem can be formulated and solved as a linear programming (LP) problem. However, previous approaches suffer from long runtime due to the large problem size. In this paper, we design two dual algorithms that efficiently evaluate voltage noises in a resistor/capacitor power grid. Our algorithms combine novel dual approaches to solve the LP problem, and a preconditioned conjugate gradient power grid analyzer. The first algorithm exploits the structure of the problem to simplify its dual problem into a convex problem, which is then solved by the cutting-plane method. The second algorithm formulates a reduced-size LP problem for each node to compute upper bound of voltage noise. Experimental results show that both algorithms are highly efficient.