Hardware reduction for matrix circuit of control Moore automaton

Abstract

The method is proposed for reduction of the area of matrix implementation of the circuit of the Moore finite state machine (FSM). The method is based on optimal state coding and decomposition of a matrix of terms on two sub-matrixes. Thus classes of the pseudoequivalent states are used. Such approach allows to reduce number of lines of the table of transitions of Moore FSM up to this value of the equivalent Mealy FSM. As a result the area of the matrixes forming excitation function of a states memory register is optimized. An example of the proposed method application is given.