Chapter 9

Flip-Flops

1
Introduction
External External
Inputs Excitation Outputs
Next State Memory Output
Logic Elements Logic

Clock

Figure Block Diagram of a sequential circuit

• Content of memory is called State.

• When clock is applied, then memory content is updated based on the excitation.
• When clock is low, then the memory content is not changed. This state is called Present State, 𝑄𝑛
• External output is function of external input and present state.
• Excitation for next state, 𝑄𝑛+1 , is function of external input and present state.

2
Introduction (Contd.)
Types of Flip-Flops
1. S-R Flip-Flops
2. J-K Flip-Flops
3. D Flip-Flops
4. T Flip-Flops

3
S-R Flip-Flop
S Q Sn Rn Qn Qn+1 Sn Rn Qn+1
S-R 0 0 0 0 0 0 Qn
CK Flip-Flop
CK=0, 𝑄 unchanged
0 0 1 1 0 1 0
CK=1, 𝑄 is determined by 𝑆 & 𝑅
R Q 0 1 0 0 1 0 1
0 1 1 0 1 1 ?
(a) Logic symbol
1 0 0 1
(c) Reduced
1 0 1 1 characteristic table
1 1 0 ?
1 1 1 ?

(b) Characteristic table

Characteristic Equation: Excitation Table:

RnQn
00 01 11 10 𝑸𝒏 𝑸𝒏+𝟏 𝑺𝒏 𝑹𝒏
Sn
0 1 0 0 0 X
1 1 1 x x 0 1 1 0
1 0 0 1
𝑄𝑛+1 = 𝑆𝑛 + 𝑅𝑛′ 𝑄𝑛
1 1 X 0
𝑆𝑛 𝑅𝑛 = 0 4
S-R Flip-Flop with Preset and Clear Inputs
Cr
Pr
Pr
S R G3 G1 Q
S Q G3 G1 Q
S-R CK CK
CK Q
Flip-Flop
R G4 G2 Q S G4 G2
R Q
Cr
(b) Using NAND latch Pr
Cr (c) Using NOR latch
(a) Logic symbol

𝑃𝑟 and 𝐶𝑟 active when 𝐶𝐾 = 0

For synchronous operation, 𝑃𝑟 = 𝐶𝑟 = 1

𝑷𝒓 𝑪𝒓 𝑸𝒏
00 Unused
01 1 (Preset)
10 0 (Clear)
11 Unchanged
5
J-K Flip-Flop
Pr
Jn Kn Qn Qn +1 J n K n Qn +1
J Q 0 0 0 0 0 0 Qn
J-K 0 0 1 1 0 1 0
CK Flip-Flop 0 1 0 0 1 0 1
K Q 0 1 1 0 1 1 Qn
1 0 0 1
(c) Reduced
Cr 1 0 1 1 characteristic table
(a) Logic symbol 1 1 0 1
1 1 1 0

(b) Characteristic table

Characteristic Equation: Excitation Table:

K nQn
J n 00 01 11 10 𝑸𝒏 𝑸𝒏+𝟏 𝐉𝒏 𝐊𝒏
0 1 0 0 0 X
1 1 1 1 0 1 1 X
1 0 X 1
𝑄𝑛+1 = 𝐽𝑛 𝑄𝑛′ + 𝐾𝑛′ 𝑄𝑛 1 1 X 0
6
D Flip-Flop
Pr

D Q Dn Qn Qn+1 Dn Qn+1
D 0 0 0 0 0
CK Flip-Flop 0 1 0 1 1
Q 1 0 1
(c) Reduced
1 1 1 characteristic table
Cr
(b) Characteristic
(a) Logic symbol table

Characteristic Equation: Excitation Table:

Qn 𝑸𝒏 𝑸𝒏+𝟏 𝑫𝒏
Dn 0 1
0 0 0
0
0 1 1
1 1 1 1 0 0
1 1 1
𝑄𝑛+1 = 𝐷𝑛 7
T Flip-Flop
Pr

T Q Tn Qn Qn +1 Tn Qn +1
T 0 0 0 0 Qn
CK Flip-Flop 0 1 1 1 Qn
Q 1 0 1
(c) Reduced
1 1 0 characteristic table
Cr
(b) Characteristic
(a) Logic symbol table

Characteristic Equation: Excitation Table:

Qn 𝑸𝒏 𝑸𝒏+𝟏 𝑻𝒏
Tn 0 1
0 0 0
0 1
0 1 1
1 1
1 0 1
𝑄𝑛+1 = 𝑇𝑛′ 𝑄𝑛 + 𝑇𝑛 𝑄𝑛′ 1 1 0
8