Combinational vs Sequential

Combinational
inputs X Circuits outputs Z

 A combinational circuit:
• At any time, outputs depends only on inputs
• Changing inputs changes outputs
• No regard for previous inputs
• No memory (history)
• Time is ignored !
 Combinational vs Sequential
inputs X Combinational outputs Z
Circuits
present state next state
Memory

 A sequential circuit:
• A combinational circuit with feedback through memory
• The stored information at any time defines a state
• Outputs depends on inputs and previous inputs
• Previous inputs are stored as binary information into memory
• Next state depends on inputs and present state
Types of Sequential Circuits

• Two types of sequential circuits:

• Synchronous: The behavior of the circuit depends on the
input signal at discrete instances of time (also called
clocked)
• Asynchronous: The behavior of the circuit depends on the
input signals at any instance of time and the order of the
inputs change
• A combinational circuit with feedback
 Combinational
Circuit
Adder Subtractor Multiplexer Demultiplexer Decoder Encoder
 Sequential
Circuit

Flip Flop Register Counter

 Binary Adder
 A combinational circuit that performs the addition of two bits is
called a half adder.
 The truth table for the half adder is listed below:

S: Sum
C: Carry

S = x’y + xy’
C = xy
 Full-Adder
 One that performs the addition of three bits(two significant bits and a
previous carry) is a full adder.

S = x’y’z + x’yz’ + xy’z’ + xyz

C = xy + xz + yz
 Flip Flops
• A flip-flop is a one bit memory similar to latches
• Solves the issue of latch transparency
• Latches are level sensitive memory element
• Active when the clock = 1 (whole duration)
• Flip-Flops are edge-triggered or edge-sensitive memory element
• Active only at transitions; i.e. either from 0  1 or 1  0

level

positive (rising) edge negative (falling) edge

Flip Flops
 Meaning Of Flip Flops
 Another names of Flip Flops
 Types Of Flip Flops
 Uses of Flip Flops
 Excitation Table
 Summarized detail of all Flip Flops
 Flip Flops is a binary cell capable of
storing one bit of data.
 Flip flops has two outputs

1. Normal 2.Compliment
Output Output
Flip Flop is a Sequential Circuit

Present Past
Output
input output
Types of Flip Flops
SR Flip Flop
JK Flip Flop
T Flip Flop
D Flip Flop
SR Flip Flop (Set Reset)

input output

S R Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
1 1 ?
SR Flip Flop

S R Q(N+1)
0 0 Q(N) No Change
0 1 0 Clear to 0
1 0 1 Set to 1
1 1 ? Invalid
 S R Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
S R Q(N) Q(N+1) 1 1 ?
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 X
1 1 1 X
Invalid
 R.Q(N) S R Q(N) Q(N+1)
S 00 01 11 10
0 0 0 0
0 0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1
1 0 1 1
1 1 0 X
1 1 1 X
 R.Q(N) S R Q(N) Q(N+1)
S 00 01 11 10
0 0 0 0
0 0 0 1 1
1 0 1 0 0
0 1 1 0
1 0 0 1
1
1 1 X X 1 0 1 1
1 1 0 X
1 1 1 X
 R.Q(N)
S R Q(N) Q(N+1)
S 00 01 11 10
0 0 0 0
0 0 0 1 1
1 0 1 0 0
0 1 1 0
1 0 0 1
1
1 1 X X 1 0 1 1
1 1 0 X
1 1 1 X
 R.Q(N) R' Q(N) S R Q(N) Q(N+1)
00 01 11 10
S 0 0 0 0
0 0 0 1 1
1 0 1 0 0
0 1 1 0
1 0 0 1
1
1 1 X X 1 0 1 1
1 1 0 X
S 1 1 1 X
 R.Q(N) R' Q(N)
00 01 11 10
S
0
1
Q(N+1)= S+ R' Q(N)
1
1 1 X X

S
 S R Q(N) Q(N+1)
Q(N) Q(N+1) S R 0 0 0 0
0 0 0 X 0 0 1 1
0 1 1 0 0 1 0 0
1 0 0 1 0 1 1 0
1 1 X 0 1 0 0 1
1 0 1 1
1 1 0 X
1 1 1 X
In SR Flip Flop invalid state is present
when S and R inputs are 1.
To avoid this JK Flip Flop is used.
JK Flip Flop is refinement of SR Flip Flop .
JK Flip Flop S R Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
input output
1 1 ?

J K Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
1 1 Q'(N)
JK Flip Flop

J K Q(N+1)
0 0 Q(N) hold

0 1 0 Clear to 0
1 0 1 Set to 1
1 1 Q'(N) Toggel
 J K Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
J K Q(N) Q(N+1) 1 1 Q'(N)
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
 K.Q(N) J K Q(N) Q(N+1)
J 00 01 11 10
0 0 0 0
0 0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1
1 0 1 1
1 1 0 1
1 1 1 0
 K.Q(N) J K Q(N) Q(N+1)
J 00 01 11 10
0 0 0 0
0 0 0 1 1
1 0 1 0 0
0 1 1 0
1 0 0 1
1
1 1 1 1 0 1 1
1 1 0 1
1 1 1 0
 K.Q(N) J K Q(N) Q(N+1)
J 00 01 11 10
0 0 0 0
0 0 0 1 1
1 0 1 0 0
0 1 1 0
1 0 0 1
1
1 1 1 1 0 1 1
1 1 0 1
1 1 1 0
 K.Q(N)
K'Q(N)
J K Q(N) Q(N+1)
00 01 11 10
J 0 0 0 0
0 0 0 1 1
1 0 1 0 0
0 1 1 0
1 0 0 1
1
1 1 1 1 0 1 1
1 1 0 1
1 1 1 0
JQ'(N)
 K.Q(N)
K'Q(N)
00 01 11 10
J
0
Q(N+1)= K'Q(N)+ JQ'(N)
1

1
1 1 1

JQ'(N)
 J K Q(N) Q(N+1)
Q(N) Q(N+1) J K 0 0 0 0
0 0 0 X 0 0 1 1
0 1 1 X 0 1 0 0
1 0 X 1 0 1 1 0
1 1 X 0 1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0
D Flip Flop (Data Flip Flop)

 D Flip Flop is called Transparent latch

 Because Input= Output
 SR Flip Flop can be converted into D Flip Flop by
applying inverter between S and R.
D Flip Flop (Transparent
latch)

input output

D Q(N+1)
0 O Clear to 0
1 1
Set to 1
 D Q(N+1)
0 O
1 1

D Q(N) Q(N+1)
0 0 0
0 1 0
1 0 1
1 1 1
 Q(N)
D 0 1
D Q(N) Q(N+1)
0 0 0 0
0 1 0
1 0 1
1 1 1 1
Characteristic Equation

Q(N)
D 0 1
D Q(N) Q(N+1)
0 0 0 0
0 1 0
1 0 1
1 1 1 1 1 1
 Q(N)
D 0 1
D Q(N) Q(N+1)
0 0 0 0
0 1 0
1 0 1
1 1 1 1 1 1

D
 Q(N)
D 0 1

Q(N+1)= D
1 1 1

D
Q(N) Q(N+1) D D Q(N) Q(N+1)
0 0 0 0 0 0
0 1 1 0 1 0
1 0 0 1 0 1
1 1 1 1 1 1
T Flip Flop

 Toggle Flip Flop is obtained from JK Flip Flop.

 In JK Flip Flop when inputs J and K connected to provide

a single input by T

J=K=T
T Flip Flop
input output

T Q(N+1)
0 Q(N)
1 Q'(N)
 T Q(N+1)
0 Q(N)
T Q(N) Q(N+1)
1 Q'(N)
0 0 0 =Q(N)
0 1 1 =Q(N)
1 0 1
1 1 0
 Q(N)
T 0 1
T Q(N) Q(N+1)
0 0 0 0
0 1 1
1 0 1
1 1 1 0
Characteristic Equation

Q(N)
T 0 1
T Q(N) Q(N+1)
0 0 0 0
1
0 1 1
1 0 1
1 1 1 1 0
Characteristic Equation
T'Q(N)
Q(N)
T 0 1
T Q(N) Q(N+1)
0 0 0 0
1
0 1 1
1 0 1
1 1 1 1 0

TQ'(N)
Characteristic Equation
T'Q(N)
Q(N)
T 0 1

0
1

Q(N+1)= T Q(N)
1 1

TQ'(N)
Q(N) Q(N+1) T T Q(N) Q(N+1)
0 0 0 0 0 0
0 1 1 0 1 1
1 0 1 1 0 1
1 1 0 1 1 0
JK Flip Flop Is Universal Flip Flop

J K Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
1 1 Q'(N)
 JK Flip Flop Is Universal Flip Flop

J K Q(N+1)
0 0 Q(N)

SR 0 1 0
1 0 1 D T Flip
1 1 Q'(N) Flop
S R Q(N+1) D Q(N+1)
0 0 Q(N) 0 O
0 1 0 1 1
1 0 1
1 1 ?

T Q(N+1)
0 Q(N)
1 Q'(N)
 June 2018

92. In RS flip-flop, the output of the flip-flop at time

(t+1) is same as the output at time t, after the
occurrence of a clock pulse if :

(1) S=R=1 (2) S=0, R=1

(3) S=1, R=0 (4) S=R=0
S R Q(N+1) D Q(N+1)
0 0 Q(N) 0 O
0 1 0 1 1
1 0 1
1 1 ? T Q(N+1)
0 Q(N)
1 Q'(N)
J K Q(N+1)
0 0 Q(N)

SR 0 1 0
1 0 1 D T Flip
1 1 Q'(N) Flop
Q(N) Q(N+1) S R J K D T
0 0 0 X 0 X 0 0
0 1 1 0 1 X 1 1
1 0 0 1 x 1 0 1
1 1 X 0 x 0 1 0
Characteristic Equation
Q(N+1)= S+ R' Q(N)

Q(N+1)= K'Q(N)+ JQ'(N)

Q(N+1)= D

Q(N+1)= T Q(N)
 Uses of Flip Flops
Flip Flops are used as data storage elements.

A flip Flop is a device used to store single bit data (Binary

Digit)

Flip Flops are used to design REGISTERS to store n number of

BITS.

Also Flips Flops are used in COUNTERS to count clock Pulse.

 June 2018
92. In RS flip-flop, the output of the flip-flop at time (t+1)
is same as the output at time t, after the occurrence of
a clock pulse if :
(1) S=R=1 (2) S=0, R=1
(3) S=1, R=0 (4) S=R=0

S R Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
1 1 ?
 June 2018
92. In RS flip-flop, the output of the flip-flop at time (t+1)
is same as the output at time t, after the occurrence of
a clock pulse if :
(1) S=R=1 (2) S=0, R=1
(3) S=1, R=0 (4) S=R=0

S R Q(N+1)
0 0 Q(N)
0 1 0
1 0 1
1 1 ?