Theoretical bounds for switching activity analysis in finite-state machines

Author

Marculescu, Diana ; Marculescu, Radu ; Pedram, Massoud

Author_Institution

Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA

Volume

8

Issue

3

fYear

2000

fDate

6/1/2000 12:00:00 AM

Firstpage

335

Lastpage

339

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.

Keywords

Markov processes; encoding; finite state machines; logic design; sequential switching; state assignment; FSM states; Markov chain model; average Hamming distance; finite-state machines; high-level power model; lower bounds; performance limits; state assignment algorithm; state encoding; switching activity analysis; theoretical bounds; upper bounds; Automata; Control system synthesis; Encoding; Energy consumption; Hamming distance; Hardware design languages; High level synthesis; Power system modeling; Process design; Upper bound;

fLanguage

English

Journal_Title

Very Large Scale Integration (VLSI) Systems, IEEE Transactions on

Publisher

ieee

ISSN

1063-8210

Type

jour

DOI

10.1109/92.845899

Filename

845899