Exact and approximate estimation for maximum instantaneous current of CMOS circuits

Authors:
Y.-M. Jiang;K.-T. Cheng
Affiliations:
Dept. of Electrical & Computer Engineering, University of California, Santa Barbara, CA;Dept. of Electrical & Computer Engineering, University of California, Santa Barbara, CA
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
1998

Citing 3
Cited 3

Acyclic multi-way partitioning of Boolean networks

DAC '94 Proceedings of the 31st annual Design Automation Conference
Vector generation for maximum instantaneous current through supply lines for CMOS circuits

DAC '97 Proceedings of the 34th annual Design Automation Conference
Pattern independent maximum current estimation in power and ground buses of CMOS VLSI circuits: Algorithms, signal correlations, and their resolution

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Power estimation starategies for a low-power security processor

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
RT-level vector selection for realistic peak power simulation

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Modeling and estimation of power supply noise using linear programming

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact solutions for the maximum instantaneous current for small circuits, and tight upper bounds for large circuits. We formulate the maximum instantaneous current estimation problem as an integer linear programming (ILP) problem, and solve the corresponding ILP formulae to obtain the exact solution. For large circuits we propose to partition the circuits, and apply our ILP-based approach for each sub-circuit. The sum of the exact solutions of all sub-circuits provides an upper bound of the exact solution for the entire circuit. Our experimental results show that the upper bounds produced by our approach combined with the lower bounds produced by a genetic-algorithm-based approach confine the exact solution to a small range.