Minimization of incompletely specified mealy finite-state machines by merging two internal states

Experiments on Minimization Method of Incompletely Specified Finite State Machines for Low Power Design

“…The given process repeats as long as there exists a possibility for at least one pair of FSM states merging. The method was described more precisely in paper [11].…”

“…In distinction from [11], in the present paper we chose for merging at each step the pair (a i , a j ) that best satisfies the optimization criteria in terms of power consumption, and leaves the maximum possibilities for merging other pairs in G. This procedure is repeated while at least one pair of states can be merged. Let (a s , a t ) be a pair of states in G, where P st is the estimate of power consumption, and M st is the estimate of the possibility to merge other states.…”

“…Using the method described in [11], form the set G of pairs of states that admit merging. If G =  (no pairs can be merged), go to step 5 2.…”

“…Merging of the states a i and a j (step 4 of Algorithm 1), minimization of the number of transitions (step 6 of Algorithm 1) and minimization of the number of input variables (step 7 of Algorithm 1) are performed as described in [11].…”

“…To provide the best possibilities for merging other states, M st should be maximized. Using the method described in [11], the set G st of pairs of states that can be merged upon merging the pair (a s , a t ) must me find. After that, the parameter M st can be calculated as the cardinality of the set G st (M st = | G st |).…”