Theoretical bounds for switching activity analysis in finite-state machines

Authors:
Diana Marculescu;Radu Marculescu;Massoud Pedram
Affiliations:
Carnegie-Mellon Univ., Pittsburgh, PA;Carnegie-Mellon Univ., Pittsburgh, PA;Univ. of Southern California, Los Angeles
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on low-power electronics and design
Year:
2000

Citing 0
Cited 3

A stimulus-free graphical probabilistic switching model for sequential circuits using dynamic bayesian networks

Proceedings of the 41st annual Design Automation Conference
Bounds on FSM Switching Activity

Journal of Signal Processing Systems
Crosstalk-aware channel coding schemes for energy efficient and reliable NOC interconnects

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in finite state machines (FSMs). Using a Markov chain model for the behavior of the FSM states, we derive theoretical bounds for the average Hamming distance on the state lines which are valid irrespective of the state encoding used in the final implementation. Such lower and upper bounds, in addition to providing a target for any state assignment algorithm, can also be used as parameters in a high-level power model and thus provide an early indication about the performance limits of the target FSM.