Maximum Instantaneous Power Estimation by Subgraph Coloring

Bao Liu
October 12, 2005

Finding maximum instantaneous power consumption helps estimation of worst-case supply voltage drop and lifetime of a VLSI system. We observe signal correlations represented by logic inversions, and present a maximum subgraph two-coloring formulation for the problem. We show the problem is NP-hard, and the complexity comes from the presence of {\em reconvergent fanouts} besides inputs signal correlations. We further develop an efficient algorithm for general VLSI designs of practical sizes. Our experimental results on the ISCAS'89 benchmark show our subgraph coloring algorithm achieves $4.31\%$ less standard deviation of maximum instantaneous power estimate than the greedy transition assignment algorithm in \cite{WangRC96}; and a $2.82\%$ standard deviation of maximum instantaneous power estimate with 2-3 orders of runtime speedups compared with pattern-dependent simulation techniques.

How to view this document

The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego,

[ Search ]

This server operates at UCSD Computer Science and Engineering.
Send email to