Half-Hot State Assignments for Finite State Machines

The state assignment problem for the programmable logic array (PLA) implementation of finite state machines is considered. It is pointed out that the number of PLA columns can be reduced by using state assignments leading to logic that is unate in the state variables. Half-hot state assignments are proposed, where each state has an encoding in which exactly half the state variables are equal to 1. >