Trace-driven steady-state probability estimation in FSMs with application to power estimation

This paper illustrates, analytically and quantitatively, the effect of high-order temporal correlations on steady-state and transition probabilities in finite state machines (FSMs). As the main theoretical contribution, we extend the previous work done on steady-state probability calculation in FSMs to account for complex spatiotemporal correlations which are present at the primary inputs when the target machine models real hardware and receives data from real applications. More precisely: (1) using the concept of constrained reachability analysis, the correct set of Chapman-Kolmogorov equations is constructed; and (2) based on stochastic complementation and iterative aggregation/disaggregation techniques, exact and approximate methods for finding the state occupancy probabilities in the target machine are presented. From a practical point of view, we show that assuming temporal independence or even using first-order temporal models is not sufficient due to the inaccuracies induced in steady-state and transition probability calculations. Experimental results show that, if the order of the source is underestimated, not only the set of reachable sets is incorrectly determined, but also the steady-state probability values can be more than 100% off from the correct ones. This strongly impacts the accuracy of the total power estimates that can be obtained via probabilistic approaches.

[1]  D. Ross Computer-aided design , 1961, CACM.

[2]  Robert K. Brayton,et al.  Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[3]  Radu Marculescu,et al.  Efficient Power Estimation for Highly Correlated Input Streams , 1995, 32nd Design Automation Conference.

[4]  Edward J. McCluskey,et al.  Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.

[5]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[6]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[7]  Carl D. Meyer,et al.  Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems , 1989, SIAM Rev..

[8]  Chi-Ying Tsui,et al.  Power estimation methods for sequential logic circuits , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[9]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[10]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[11]  Enrico Macii,et al.  Probabilistic Analysis of Large Finite State Machines , 1994, 31st Design Automation Conference.

[12]  Enrico Macii,et al.  Markovian analysis of large finite state machines , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[14]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[15]  Radu Marculescu,et al.  Adaptive models for input data compaction for power simulators , 1997, Proceedings of ASP-DAC '97: Asia and South Pacific Design Automation Conference.

[16]  Gary S. Ditlow,et al.  Random Pattern Testability , 1984, IEEE Transactions on Computers.

[17]  Radu Marculescu,et al.  Stochastic sequential machine synthesis targeting constrained sequence generation , 1996, DAC '96.

[18]  Radu Marculescu,et al.  Sequence compaction for probabilistic analysis of finite-state machines , 1997, DAC.

[19]  G. Hachtel,et al.  Re-encoding sequential circuits to reduce power dissipation , 1994, ICCAD '94.

[20]  W. Stewart,et al.  ITERATIVE METHODS FOR COMPUTING STATIONARY DISTRIBUTIONS OF NEARLY COMPLETELY DECOMPOSABLE MARKOV CHAINS , 1984 .