A MICROPROGRAM DESIGN METHOD BASED ON MEMORY BLOCKS SEPARATED BY STATES

Abstract

In this report the connections of the synthesis method of P. Arató with the automata theory are examined. A method is elaborated for realizing the automata obtained by the above synthesis. This method is based on the results obtained here and uses some earlier results concerning the realization with memory elements enabled by states. A realization with memory elements enabled by states is obtained here, too, where the input and output constraints coming from the set of disposable memory elements are taken into consideration. A special method is elaborated for minimizing the number of variables needed in the realization of Boolean functions. The procedure is based on a new method for searching prime implicants. The conditions of the used group of states as enabling combination is investigated and the way of its application is shown. We point out that a post qualification of the specification is given by the result of the method minimizing the number of variables of the Boolean functions. The procedure is illustrated on an example.