Procedure on State Assignment That Minimizes the Number of Product Terms
Original Publication Date: 1989-May-01
Included in the Prior Art Database: 2005-Jan-27
Disclosed is a procedure for state assignment that minimizes the number of product terms for each state variable. The procedure is most suitable for a finite state machine where the inputs and the states are largely independent. The procedure will be described with an example state diagram shown in the figure. 1. Transform the Next State transition conditions for each state in the finite state machine into the sum-of-products form using De Morgan's theorems. 2. For each state in the finite state machine, count the number of conditions from the other states that will cause a transition into that state. This number is known as the sumprod for each state. For example, in the figure, the sumprod is equal to the number of In arrows for each state, plus the number of OR operators in each arrow.