A method of synthesis of finite state automations of the class C (method À3)
Key feature of methods À3 and À4 synthesis of finite state automations
of classes C and D is usage of triggers of output macrocells PLD as
units of memory of the finite state automation when dialingouts
coincide with a part of the code of inwardnesses. It considerably
allows to lower cost of implementation and simultaneously to increase
speed of finite state automations, in comparison with automata of
classes A and B.
Deprecication of implementation is ensured with decrease of number used
output PLD as output functions and a part of units of memory of an
automaton are realized on the same macrocells PLD. Besides the
combinatorial part of the finite state automation as necessity for
implementation of a part of functions of energization of units of
memory which coincide with output functions passes becomes simpler.
Deprecication of implementation is promoted also by that as codes of
inwardnesses of automata of classes C and D elementary conjunctions,
instead of complete conjunctions as in automata of classes A and B are
used.
Magnification of speed of finite state automations of classes C and D,
in comparison with the traditional approach, speaks that in automata of
classes C and D mainly output functions which, as a rule, it is easier
than functions of passages are realized that in the total reduces in
decrease of number of logical levels at synthesis of a combinatorial
part of the finite state automation.
Coding inwardnesses of an automaton of the class C is reduced to the
task of orthogonalization of strings(lines) of a ternary matrix which
are used as codes of inwardnesses of the finite state automation. The
offered algorithm allows to minimize an amount of significant values in
a ternary matrix that reduces in decrease of number of arguments of
realizable functions.
The Disadvantage of method À3 of synthesis of finite state automations
of the class C is that the automaton of the class C is an automaton
such as Moore. Therefore for coercion of the initial finite state
automation to an automaton such as Mile decomposition of inwardnesses
is used. In some cases it considerably may increase number of
inwardnesses and passages of the finite state automation