Asynchronous Sequential Machine Designing

Example -2:
Design an asynchronous sequential circuit with two inputs, x1 and x2, and two
outputs, G and R, which is to behave in the following manner. Initially, both input
values and both output values are equal to 0. Whenever G = 0 and either the value
of x1 or x2 becomes 1, G turns “on” (i.e., attains the value 1). When the value of
the second input becomes 1, R turns on. The first input value that changes from 1
to 0 turns G “off” (i.e., sets G equal to 0). The output R turns off when G is off and
either input value changes from 1 to 0.

Major Steps
1. A primitive flow table is to be constructed from the verbal description of
circuit operation. In most cases, we specify only those output values that are
associated with stable states.
2. A minimum-row reduced flow table is obtained by merging the rows in the
primitive flow table. Either the merger graph or the merger table may be used
to perform the reduction.
3. Secondary variables are assigned to the rows of the reduced flow table, from
which excitation and output tables are constructed. The output values
associated with unstable states are specified according to various design
requirements.
4. The excitation and output functions are derived, and the corresponding
hazard-free circuit constructed.

Step-1 Finding Possible States

1. From the specification of the problem, it is evident that whenever x1 =

x2 = 0 then G = R = 0, and whenever x1 = x2 = 1 then G = R = 1.
2. Consequently, columns 00 and 11 of the primitive flow table must each
contain a single stable state. When the input combination x1x2 is 01, the
 output symbol GR may be either 10 or 01, depending on the preceding
input combination. Since a different stable state must be included in each
column of the flow table for every possible output condition, column 01
must contain at least two stable states.
3. Similar arguments show that column 10 must also contain at least two
stable states, which will be associated with the output combinations 01
and 10. We thus conclude that the primitive flow table for the circuit in
question must contain six stable states.

X1 X2 G R State X1 X2 G R State
0 0 0 0 1 0 0 0 0 1
0 1 1 0 2 1 0 1 0 5
1 1 1 1 4 1 1 1 1 4
0 1 0 1 3 1 0 0 1 6
0 0 0 0 1 0 0 0 0 1

Step-2 Primitive Flow Table

(Long Primitive Flow Table) (Precise/optimize Flow Table)
 Step-3 Merger Graph

Compatible pair: {125, 346}

Step-4 Reduction of flow table

Compatible pairs: {125, 346}

Step-5 State Assignment

Step-6 Finding expression for Y, G and R using K-Map

The expression of ‘R’ will also be same as of ‘Y’

Step-7 Circuit Diagram