Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems Vol. 31; no. 2; pp. 271 - 284
• Main Authors: Mangassarian, H., Veneris, A., Najm, F. N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-02-2012; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Circuits; Computer simulation; Delay; Density; Design engineering; Electric potential; Estimation; Gates (circuits); Integrated circuit modeling; Logic gates; Maximum circuit activity; Optimization techniques; peak dynamic power; pseudo-Boolean satisfiability; SAT; Sequential circuits; Studies; Switches; Switching; Vectors
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/TCAD.2011.2169259

With lower supply voltages, increased integration densities and higher operating frequencies, power grid verification has become a crucial step in the very large-scale integration design cycle. The accurate estimation of maximum instantaneous power dissipation aims at finding the worst-case scenario where excessive simultaneous switching could impose extreme current demands on the power grid. This problem is highly input-pattern dependent and is proven to be NP-hard. In this paper, we capitalize on the compelling advancements in satisfiability (SAT) solvers to propose a pseudo-Boolean SAT-based framework that reports the input patterns maximizing circuit activity, and consequently peak dynamic power, in combinational and sequential circuits. The proposed framework is enhanced to handle unit gate delays and output glitches. In order to disallow unrealistic input transitions, we show how to integrate input constraints in the formulation. Finally, a number of optimization techniques, such as the use of gate switching equivalence classes, are described to improve the scalability of the proposed method. An extensive suite of experiments on ISCAS85 and ISCAS89 circuits confirms the robustness of the approach compared to simulation-based techniques and encourages further research for low-power solutions using Boolean SAT.