Estimation of maximum switching activity in digital VLSI circuits

Power dissipation and reliability are important issues in the design of high performance digital VLSI circuits. Power dissipation and reliability are strongly related to switching activity in the circuit. An estimate of maximum switching activity is necessary for the design of reliable circuits. The problem of estimating maximum switching activity even under a zero gate delay model is intractable. In this paper, we present an algorithm to obtain an upper bound on the maximum transition count over all possible input vectors under a zero gate delay model.

[1]  Raffaele Mosca,et al.  Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs , 1997, Inf. Process. Lett..

[2]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[3]  Farid N. Najm,et al.  Extreme Delay Sensitivity and the Worst-Case Switching Activity in VLSI Circuitsy , 1995, 32nd Design Automation Conference.

[4]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[5]  Kaushik Roy,et al.  Maximum power estimation for CMOS circuits using deterministic and statistic approaches , 1996, Proceedings of 9th International Conference on VLSI Design.

[6]  Kurt Keutzer,et al.  Estimation of power dissipation in CMOS combinational circuits using Boolean function manipulation , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Dean G. Blevins,et al.  Introduction 11-1 , 1969 .

[8]  Sung-Mo Kang,et al.  Estimation of maximum transition counts at internal nodes in CMOS VLSI circuits , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).