Sequential Circuits
Sequential Circuits
Combinational Logic
• Combinational Logic:
– Output depends only on current input
– Has no memory
Timed “States”
Set
Sensor
Memory On ¤ Off
Alarm
element
Reset
A B
A simple memory element with NOT Gates
x x x
Building a NOT Gate with NAND
x x x x
x x f
x x 0 0 1
0 1 1 impossible
0 1 combinations
1 0 1
1 0 1 1 0
x x x
Building a NOT Gate with NOR
x x x x
x x f
x x 0 0 1
0 1 0 impossible
0 1 combinations
1 0 0
1 0 1 1 0
x x x
Basic Latch
A simple memory element with NOR Gates
A simple memory element with NOR Gates
A simple memory element with NOR Gates
Set Reset
A memory element with NOR gates
Reset
Set Q
Two Different Ways to Draw the Same Circuit
Circuit and Truth Table
R S R Qa Qb
Qa
0 0 0/1 1/0 (no change)
0 1 0 1
1 0 1 0
Qb 1 1 0 0
S
R S R Qa Qb
Qa
0 0 0/1 1/0 (no change)
0 1 0 1
1 0 1 0
Qb 1 1 0 0
S
t1 t2 t3 t4 t5 t6 t7 t8 t9 t10
1
R
0
1
S
0
1
Qa ?
0
1
Qb ?
0
Time
(c) Timing diagram
The truth table for SR Flip Flop is as
shown below-
INPUTS OUTPUTS
1 1 0 Indeterminate
Truth Table
1 1 1 Indeterminate
Characteristic Equation-
From here-
Qn+1 = ( SR + SR’ ) ( Qn + Q’n ) + Qn ( S’R’ + SR’ )
Qn+1 = S + QnR’
SR Latch (NAND version)
0 S’ S’ R’ Q Q’
Q 1
0 0
0 1 1 0 Set
1 0
Q’ 0
1 R’ 1 1
X Y NAND
0 0 1
0 1 1
1 0 1
1 1 0
1 S’ S’ R’ Q Q’
Q 1
0 0
0 1 1 0 Set
1 0
Q’ 0
1 R’ 1 1 1 0 Hold
X Y NAND
0 0 1
0 1 1
1 0 1
1 1 0
1 S’ S’ R’ Q Q’
Q 0
0 0
0 1 1 0 Set
1 0 0 1 Reset
Q’ 1
0 R’ 1 1 1 0 Hold
X Y NAND
0 0 1
0 1 1
1 0 1
1 1 0
1 S’ S’ R’ Q Q’
Q 0
0 0
0 1 1 0 Set
1 0 0 1 Reset
Q’ 1
1 R’ 1 1 1 0 Hold
0 1 Hold
X Y NAND
0 0 1
0 1 1
1 0 1
1 1 0
0 S’ S’ R’ Q Q’
Q 1
0 0 1 1 Disallowed
0 1 1 0 Set
1 0 0 1 Reset
Q’ 1
0 R’ 1 1 1 0 Hold
0 1 Hold
X Y NAND
0 0 1
0 1 1
1 0 1
1 1 0
0 0 1
1 1 0
x f
S
Q
Clk
Q
R
Gated SR latch with NAND gates
S
Q
Clk
Q
R