A Heuristic Approach of Code Assignment to Obtain an Optimal FSM Design

Abstract

AbstractCircuit minimization is always helpful in obtaining efficient and compact circuits besides cost effectiveness. Minimization of an FSM (Finite State Machine) can be done in two steps i.e. State Minimization and State (Code) Assignment. The state assignment problem has remained the subject of extensive theoretical research. The state assignment problem in FSM is NP-complete, requiring therefore extensive computations, if based on any algorithm. A number of heuristics have therefore been developed to obtain good state assignments. State assignment is targeted either for area minimization or for low power. In this paper, a heuristic approach is presented related to reducing the combinational logic in an FSM i.e. area minimization. The paper also exposes the case of improper assignment of codes that results in a large circuit.KeywordsFinite State MachineState AssignmentCode Assignment