RST Flip-Flop Input Equations

There are several different usable combinations of the inputs of an RST flip-flop. It is shown how all of the possible combinations can be displayed simultaneously on three Karnaugh maps, facilitating the choice of the simplest input equations. The application equation for flip-flop Q characterized by a sequential problem is plotted on a map designated Q
ⁿ⁺¹
. Additional maps, (Q
ⁿ⁺¹
)
^*
and (Q
ⁿ⁺¹
)' are derived from Q
ⁿ⁺¹
. Cells corresponding to prime implicants not containing the variable Q are identified on these maps, and are used to enter the properly designated arbitrary elements on the R, S, and T maps of flip-flop Q. The method is based on the following theorem: ``If Q
ⁿ⁺¹
= (g
₁
Q + g
₂
Q')
ⁿ
, and if F is the set of all prime implicants that do not contain the literals Q or Q', then the Boolean function g
₁
g
₂
is the union of all the prime implicants of Q
ⁿ⁺¹
that belong to the set F.'' A simple illustrative example is included.