Escolar Documentos
Profissional Documentos
Cultura Documentos
Slide 3
Slide 4
R = AB + P
is taken to mean
P = (A+B)'
Pt = (At-1+Bt-1)'
Slide 5
Slide 6
Slide 7
States S(t)
S(t) can be one of a finite number of states We noted that the flip-flop has only two states defined by Q=0 and Q=1 In a digital circuit state changes are caused by a clock pulse given to the D-Q flip flop(s)
Slide 8
I S DQ g O
Slide 9
D-Q
Slide 10
D-Q
Slide 11
Slide 12
A design problem
Sequential Counter
0 1 2 3 4 5 6
Slide 14
Slide 16
Output Vectors
0 A 3 D 1 B
Slide 17
2 C
DOC112: Computer Hardware Lecture 09
Slide 18
State representation
We now have to decide how we are to represent each state: One flip flop per state would be an expensive possibility. Three flip flops can be though of as a three bit memory, and therefore could represent eight states. The values Q2,Q1 and Q0 define the state.
DOC112: Computer Hardware Lecture 09 Slide 19
Problem Break
If we wanted our counter to count from 0 to 9 rather than from 0 to 6 how many states would it need? What would the finite state machine look like? How many flip flops would we need to represent the states?
Slide 21
Problem Break
0 1
6 G 7 H
0 0 1
8 I
10 States
0
5 F
1
9 J
4 flip flops
1 0
4 E
1 1
3 D
0 A
1 0
1
2 C
1 B
Slide 22
Slide 23
Slide 24
Output Logic
Our output logic is now completely specified, for example we want the segment 1 to be lit when displaying 0,2,3,5 but not 1 or 4, so: O1 = S0 + S2 + S3 + S5 O1 = Q2'Q1'Q0' + Q2'Q1'Q0 + Q2'Q1Q0 + Q2Q1'Q0
1 Sequential Counter 0 1 2 3 4 5 6
Slide 25
State 0 1 2 3 4 5
Slide 27
Slide 28
Unused States
The unused states were designated don't care states. To get the minimum representation we will need to include them as don't cares in our Karnaugh maps. This can cause problems since we will allocate the dont cares real values in the final design.
Slide 29
6 0 1
0,1
7 0,1
1 1 0
Slide 31
0 0,1 7
Slide 32
Slide 33
Isomorphic Assignments
Since flip-flops always have complementary outputs (Q and Q') The same circuit will result from complementing each column of our assignment
State 0 1 2 3 4 5 Assignment 000 001 010 011 100 101 Isomorphs 100 010 110 101 011 111 110 000 100 111 001 101 000 110 010 001 111 011
These isomorphs are created by: Invert Column 1 Invert Column 2 Invert Columns 1 and 2
Slide 34
1 A
0
0 B
0 1
11 F
0 1
1 B
Slide 35
Slide 36
2 A
011
3 B
010
000
Slide 37
1 0 A 1 1 B
110
3 D 1
111 011
2 C 0
Slide 38