Finite State Machine Synthesis Based on Relay-Based Algorithm

This paper presents a relay-based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipations. The algorithm utilizes the experience of past runners as in a relay race by a guide and the configuration of past solutions by a relay. Combined with rough and focusing methods, it could escape local optima and achieve an effective convergence. The experiments performed on a suite of benchmarks have established the fact that the proposed method outperforms the published GA-based algorithms. The quality of the solution obtained and the high rate of convergence have shown the effectiveness of the proposed method in solving the difficult problem.