Abstract

In this paper, we study the problem of state assignment as it relates to silicon area, propagation delay time and testability of finite state machines. The results of a study involving various FSM benchmarks show that the simple technique of one-hot encoding often produces better results than those attained by complex state assignment algorithms.