Lecture 19

Digital 1
Excitation Table
 The design of sequential circuits other than D type flip
flops is complicated by the fact that input equations
must be derived indirectly from the state table.
 It is necessary to derive a functional relationship
between the state table and the input equations.
 During the design, we usually know the transition
from present to next state but we need to find the flip
flop input conditions that will cause the required
transition.
 We need a table that lists the required inputs for a
given change of state, called an excitation table.

2 EC 381 Digital Systems Fall 2013

Excitation Tables

3 EC 381 Digital Systems Fall 2013

Synthesis Using JK Flip Flops
 Synthesis of circuits with JK flip flops is the same as
with D flip flops except that the input equations must
be evaluated from the present-state to the next-state
transition derived from the excitation table.

4 EC 381 Digital Systems Fall 2013

Example JK Synthesis
 1- State diagram
Example: No output 0

1 input
00
4 states 1
1
1

01 11 0

0 1
10

0
5 EC 381 Digital Systems Fall 2013
Example JK Synthesis
2- State Table
Present Next
State State

0 0 0 1

6 EC 381 Digital Systems Fall 2013

Example JK Synthesis
 3- Input Equations

Bx
00 01 11 10
A
0 0 0 0 1 JA = BX’

1 X X X X

7 EC 381 Digital Systems Fall 2013

 Example JK Synthesis

8 EC 381 Digital Systems Fall 2013

JK Synthesis Logic
 4- Circuit Diagram

9 EC 381 Digital Systems Fall 2013

Synthesis Using T Flip Flops
 Synthesis of circuits with T flip flops is the same as
with JK flip flops except that the input equations must
be evaluated from the present-state to the next-state
transition derived from the T excitation table.

10 EC 381 Digital Systems Fall 2013

Synthesis Using T Flip Flops
 Design a counter that counts from “000” to “111” and then
back to “000” again.
 Use T Flip-Flops
 Solution
 1- State Diagram

 2- Number of states=8  3 T flip flops (A2,A1,A0)

11 EC 381 Digital Systems Fall 2013

Example: T Flip Flop Synthesis
 No Input
 No output
 3-State table

12 EC 381 Digital Systems Fall 2013

Example: T Flip Flop Synthesis
 4- Input Equations

 5- Circuit Diagram

13 EC 381 Digital Systems Fall 2013

Example – Sequence Recognizer
 Circuit has input, X, and output, Z
 Recognizes sequence 1101 on X
 Specifically, if X has been 110 and next bit is 1,
make Z high

14 EC 381 Digital Systems Fall 2013

How to Design States
 States remember past history
 Clearly must remember we’ve seen 110 when next 1
comes along

 Tell me one necessary state!

15 EC 381 Digital Systems Fall 2013

Beginning State
 Some state, A
 If 1 appears, move to next state B

Input / Output

16 EC 381 Digital Systems Fall 2013

Second 1
 New state, C
 To reach C, must have seen 11

17 EC 381 Digital Systems Fall 2013

Next a 0
 If 110 has been received, go to D
 Next 1 will generate a 1 on output Z

18 EC 381 Digital Systems Fall 2013

What else?
 What happens to arrow on right?
 Must go to some state.
 Where?

19 EC 381 Digital Systems Fall 2013

What Sequence?
 Here we have to interpret problem
 We’ve just seen 01
 Is this beginning of new 1101?
 Or do we need to start over w/ another 1?

20 EC 381 Digital Systems Fall 2013

Fill in

21 EC 381 Digital Systems Fall 2013

Complete Sequence Recognizer

22 EC 381 Digital Systems Fall 2013

State Table
 Just fill in from diagram

23 EC 381 Digital Systems Fall 2013

Problem 5.18
 Design a sequential circuit with two JK flip-flops A
and B and two inputs E and F .
 If E = 0, the circuit remains in the same state
regardless of the value of F .
 When E = 1 and F = 1, The circuit goes through the
state transitions from 00 to 01, to 10, to 11, back to
00, and repeats.
 When E = 1 and F = 0, the circuit goes through the
state transitions from 00 to 11, to 10, to 01, back to
00, and repeats.

24 EC 381 Digital Systems Fall 2013

25 EC 381 Digital Systems Fall 2013
26 EC 381 Digital Systems Fall 2013