MULTICODE STATE ASSIGNMENT OF A SEQUENTIAL MACHINE.

A tabular approach is presented to select binary variables describing the internal states of a finite state sequential machine. The binary assignment is selected in such a way as to minimize the number of input variables of the combinational circuit. The number of possible assignments grows extremely rapidly with the number of states. The approach developed will be used to obtain optimum multicode state assignments of a sequential machine wtih 2**k** minus **1 plus 1 to 2**k states implemented with k state variables. This is achieved by tabulating all possible set pairs and selecting the optimum one. The optimum assignment is defined as the one that produces realizations with reduced dependencies.