Vector Compaction Using Dynamic Markov Models (Special Section on VLSI Design and CAD Algorithms)
Radu Mărculescu, Diana Marculescu, Massoud Pedram · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 1997
Evaluation of power dissipation is a critical step in the design of today’s ICs. Power disssipation is strongly input pattern dependent and hence, to obtain accurate power values, one must simulate the circuit with a large number of input vectors that typify the application data. The goal of this paper is to present an effective and robust technique for compacting a large sequence of input vectors into a much smaller input sequence so as to reduce the circuit/ gate level simulation time by orders of magnitude and mantain the accuracy of the power estimates. In particular, this paper introduces and characterizes a family of dynamic Markov trees that can model complex spatiotemporal correlations which occur during power estimation both in combinational and sequential circuits. This new framework is very effective and flexible: the Markov model itself is derived through a one-pass traversal of the initial sequence and it can be used after that with any available simulator to derive power consumption. As the results demonstrate, large compaction ratios of 1-2 orders of magnitude can be obtained without significant loss (less than 3% on average) in the accuracy of power estimates.