It is now necessary to examine the remaining boxes.

Line 1 :

Box  10  (a = 1,  m = 0)

If we press "a" while L is off, we move to a steady-state situation (a = 1, m = 0, L = 0), so we write 3 in the box which shows that we go through the transient state 3.

Line 2 :

Box 11  (a = 1,  m = 1)

If we press "a" while "m" has not been released, we go to the extinction of the lamp so to the steady state (a = 1, m = 1, L = 0). We write 4 in the box.

Line 3 :

Box 01  (a = 0, m = 1)

If we press «on» while the lamp is already on, this has no effect and we go to the steady state (a = 0, m = 1, L = 1), we write 1 in the box.

Line 4 :

Box 00  (a = 0, m = 0)

We release "a" and the lamp remains off, so we go to steady state (a = 0, m = 0, L = 0), we write 0 in the box.

Line 5 :

1)  Box 01  (a = 0, m = 1)

We release "a" while "a" and «m» were activated and L was extinguished. The lamp comes back because we return to the stable state (a = 0, m = 1, L = 1), so we write 1 in the box.

2)  Box 10  (a = 1, m = 0)

We release the start button while L is off, we return to the stable state (a = 1, m = 0, L = 0), so we write 3 in the box.

The primitive matrix completed in Figure 24 is thus obtained.

c)  Finding the contracted matrix

It is desirable to reduce the original matrix of states to a contracted matrix in order to reduce the number of additional lines, which introduce new excitations and new complementary variables or transfers.

Contraction or merger rules :

     It is possible to contract the primitive matrix of states by superimposing two lines if they present vertically the same states.

     Two lines can be merged into one when there is a steady state or a transient of the same number in the same column or a stable or transient state with a hatched box in the same column, because the hatched box indicates that, for technological reasons, this case can not occur and is therefore indifferent.

     Output states do not intervene in the possible overlays.

Study of the possibilities for line 1 :

Let's compare line 1 with line 2 : they are not superimposable because for a = 0 and m = 0, we have the state on the first line and 2 on the second.

Let's compare line 1 with line 3 : they are not superimposable because we have on the first line and 2 on the third for a = 0 and m = 0.

Let's compare line 1 with line 4 : these two lines are superimposable because we have corresponds to 0, to 1 corresponds an impossibility, to an impossibility corresponds 4, to 3 corresponds .

Let's compare line 1 with line 5 : these two lines are superimposable.

For line 2, the possible combinations are :

Lines 2 and 3 stackable.

Lines 2 and 4 are not stackable.

Line 2 and 5 stackable.

For line 3, the possible combinations are :

Lines 3 and 4 non-stackable

Lines 3 and 5 stackable

For line 4, the possible combinations are :

Lines 4 and 5 stackable

d)  Fusion polygon

Let's spread on a circle by counting in a clockwise direction the five points representing the five lines of the primitive matrix of states : we get Figure 25.

Connect together all the stackable lines as shown in Figure 26.

e)  Interpretation of the fusion polygon

We get two triangles of vertices 1-5-4 and vertices 2-5-3.

Rule :

For example, we can merge 2-3-5 ... n vertices connected to each other, but each vertex must appear in only one group so that in our case we can make the groupings :

1-4-5  and  2-3  or  2-3-5  and  1-4

We will prefer 1-4-5 and 2-3 because inside each group the state of the outputs is identical.

This will later facilitate the groupings in the final table of Karnaugh, but it is not obligatory and especially not always possible.

f)  Contrasted matrix or fusion table.

Let's superimpose lines 1-4-5 shown in Figure 27.

Figure 28 shows lines 1-4-5 after contraction.

Figure 28 shows that stable states outweigh transitions on fusion.

Figure 29 shows lines 2-3 of the primitive matrix before merging.

Figure 30 shows lines 2-3 after merging.

We can reconstruct a so-called contracted matrix using lines 1-4-5 and 2-3. Figure 31 shows this contracted matrix.

We see in Figure 31 that the contracted matrix comprises two lines, which means that the complementary variables or transfers are only one number that we call x.

For a matrix of 2¹ = 2 lines, we have 1 complementary variable, for 2² = 4 lines, we have 2 complementary variables and for 2ⁿ lines we have n variables.

If the matrix includes 2⁰ = 1 line, the system under review can be summarized as a combinatorial system (no additional variables).

g)  Establishment of Karnaugh's chart reducing the problem to a combinatorial problem.

Let's establish Karnaugh's array of output by plotting the output binary values for the stable states considered in the contracted matrix.

We will look for the state L for a given stable state in the primitive matrix of states (Figure 21).

For     L = 0

For     L = 1

For     L = 1

For     L = 0

For     L = 0

We get Figure 32.

There are three boxes to fill in for transition states.

We will report the logical state of the output (1 or 0) for the steady state to which the transient state considered evolves.

The transient state 1 evolves towards the stable state for which L = 1

The transient state 4 evolves towards the stable state for which L = 0

The transient state 3 evolves towards the stable state for which L = 0

Let's put these values in the matrix of Figure 32.

We get the Karnaugh chart from Figure 33.

From this table of Karnaugh, the problem is again a combinatorial problem.

We can achieve the groupings as we have learned to do. They are represented in figure 34.

We obtain the following equation of L :

L = m + x

Let  L = (m + x)

We find the equation obtained by the previous methods.

We have 2 methods to solve a sequential problem :

• The generalized phase method

• HUFFMAN's matrix method

We will prefer the Huffman method which is more abstract but more systematic and more secure. However, the generalized phase method has the advantage of allowing a visualization of the possible operating hazards and their eliminations easier. One can therefore only recommend the use of the phase method as verification of a scheme obtained by the method of Huffman to look for possible hazards.

Now let's look at Bistable Flip-Flops.

Click here for the next lesson or in the summary provided for this purpose.	Top of page
Previous Page	Next Page

---

Nombre de pages vues, à partir de cette date : le 27 Décembre 2019