Title :
Upper and lower bounds on FSM switching activity
Author :
Athanasopoulou, E. ; Hadjicostis, C.N.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Abstract :
This paper obtains upper and lower bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven with typical input sequences. By exploiting the symmetries between the Hamming distances of state encodings, we obtain tight bounds on the average Hamming distance, which is proportional to the average switching activity and the overall power dissipation of the system. Since these bounds are independent of the state assignment and the actual circuit implementation, they can be used at an early stage of the FSM design to indicate the largest/smallest possible power consumption. The paper also discusses how redundant state encodings can be chosen to decrease power consumption.
Keywords :
CMOS logic circuits; Markov processes; finite state machines; logic design; low-power electronics; state assignment; CMOS logic gate; FSM switching activity; Hamming distances; Markov chain; average Hamming distance; finite state machine; input sequences; lower bounds; power consumption; power dissipation; redundant state encodings; state encodings; state lines; upper bounds; Automata; CMOS logic circuits; Encoding; Energy consumption; Frequency; Hamming distance; Power dissipation; Power system reliability; Probability; Switching circuits;
Conference_Titel :
Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on
Print_ISBN :
0-7803-7761-3
DOI :
10.1109/ISCAS.2003.1206301
