DocumentCode :
2143253
Title :
Finite-state machine partitioning for low power
Author :
Benini, Luca ; De Micheli, Giovanni ; Vermeulen, Fokke
Author_Institution :
Comput. Syst. Lab., Stanford Univ., CA, USA
Volume :
2
fYear :
1998
fDate :
31 May-3 Jun 1998
Firstpage :
5
Abstract :
We describe an algorithm for the automatic synthesis of a network of interacting FSMs starting from a single state-table specification. The sub-machines in the decomposed FSM communicate through a set of additional interface signals. The decomposed implementation has low power dissipation because one single sub-machine is clocked at any given time and it controls the outputs values while all other sub-machines are idle. There is full cycle-by-cycle equivalence between the input-output behavior of the decomposed and undecomposed implementation
Keywords :
finite state machines; automatic synthesis; decomposition; finite state machine; interacting FSM network; interface signals; low power; partitioning algorithm; state-table; sub-machines; Clocks; Contracts; Flip-flops; Logic; Magnetic heads; Partitioning algorithms; Tail;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1998. ISCAS '98. Proceedings of the 1998 IEEE International Symposium on
Conference_Location :
Monterey, CA
Print_ISBN :
0-7803-4455-3
Type :
conf
DOI :
10.1109/ISCAS.1998.706780
Filename :
706780
Link To Document :
بازگشت