DocumentCode :
2989090
Title :
A state assignment algorithm for finite state machines
Author :
Skias, D. ; Haniotakis, Th ; Tsiatouhas, Y. ; Arapoyanni, A.
Author_Institution :
Dept. of Inf., Athens Univ., Greece
Volume :
2
fYear :
2000
fDate :
2000
Firstpage :
823
Abstract :
In this paper an algorithm to generate an optimum initial state assignment for Finite State Machines is presented, that in combination with the Kantabutra-Andreou method (1994) can provide a state assignment with the minimum number of bits
Keywords :
finite state machines; minimisation of switching nets; state assignment; Kantabutra-Andreou method; finite state machines; minimum number of bits; minimum switching activity; optimum initial state assignment; random state machine generator; state assignment algorithm; Automata; Circuit synthesis; Informatics; Microelectronics; Noise reduction; Power dissipation; Silicon; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on
Conference_Location :
Jounieh
Print_ISBN :
0-7803-6542-9
Type :
conf
DOI :
10.1109/ICECS.2000.913003
Filename :
913003
Link To Document :
بازگشت