Sequential Circuits wk9

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 18

SEQUENTIAL CIRCUIT

Presented by Jenice Lynch – [email protected]


SEQUENTIAL CIRCUIT
• A sequential circuit is a logical circuit, where the output depends on the present value of the
input signal as well as the sequence of past inputs.
• A sequential circuit is a combination of combinational circuit and a storage element.
• Sequential circuits use current input variables and previous input variables which are stored
and provides the data to the circuit on the next clock cycle.
TYPES OF SEQUENTIAL CIRCUITS
• Sequential circuits are classified into two types
• Synchronous Circuit
• Asynchronous Circuit

• Synchronous sequential circuits, the state of device changes at discrete times in response to a
clock signal. 
• Asynchronous circuits, the state of the device changes in response to changing inputs.
Asynchronous sequential circuit
These circuit do not use a clock signal but uses the pulses of the inputs. These circuits
are faster than synchronous sequential circuits because there is no clock pulse and they
change their state immediately when there is a change in the input signal. We use
asynchronous sequential circuits when speed of operation is important
and independent of internal clock pulse.
Synchronous sequential circuit
These circuit uses clock signal. Because they wait for the next clock pulse to arrive to
perform the next operation, these circuits are bit slower compared to asynchronous.
Level output changes state at the start of an input pulse and remains in that until the
next input or clock pulse.
• We use sequential circuits to design Counters, Registers, RAM, MOORE/MEALY Machine
and other state retaining machines.

• Elementary building blocks: Flip-flops


FLIP-FLOP
There are 4 types of flip-flops
• SR Flip-Flop/RS Flip-Flop
• JK Flip-Flip
• Q Flip-Flop
• T Flip-Flop
S-R/R-S FLIP FLOP
• The S-R flip-flop is the simplest flip-flop.
• The inputs are Set and Reset.
• The flip-flop basically uses NAND gates
with an additional enable pin.
• The circuit gives output only when the
enable pin is high.
• The NOR gate implementation is called the
R-S flip-flop.
• 1-1 input state is undefined
JK FLIP-FLOP

• JK flip-flop is one of the important flip-flops


• an improvement on the SR flip flop as it can handle 1-1
input state
D FLIP-FLOP
• D flip-flop has a single data line and a clock input.
• The D flip-flop is the simplification of an SR flip-flop.
T FLIP-FLOP
• T or Toggle
• changes its output on each clock pulse
• can be made from a J-K flip-flop by tying both
of its inputs high
• useful for constructing binary
counters, frequency dividers, and general binary
addition devices
COUNTER DESIGN
1. Describe a general sequential circuit in terms of its basic parts and its input and outputs
2. Draw the state diagram for the given sequence
3. Develop  the FF transition table 
4. Derive truth table for the specific counter sequence
5. Use K-map to derive the logic equations
6. Use the Boolean expressions to implement the counter
COUNTER DESIGN
Describe a general sequential circuit in Draw the state diagram for the given sequence
terms of its basic parts and its input and
outputs

Design a 2 bit up/down counter with an


input D which determines the up/down
function. Thus when D=0, the count
sequence is 00,01,10,11,00 ... when D=1,
the count sequence is 00,11,10,01,00 …
COUNTER DESIGN
Develop  the FF transition table 

J K Q (present) Q (next) State


0 0 0 0
No Change
0 0 1 1 QN QN+1 J K
0 1 0 0
RESET/CLEAR 0 0 0 X
0 1 1 0
1 0 0 1 0 1 1 X
SET/READY 1 0 X 1
1 0 1 1
1 1 0 1 1 1 X 0
TOGGLE
1 1 1 0
 

COUNTER DESIGN
Derive truth table for the specific Present State Next JK flip flop
counter sequence State inputs
D A B A B JA KA JB KB
0 0 0 0 1 0 X 1 X
QN QN+1 J K 0 0 1 1 0 1 X X 1
0 0 0 X 0 1 0 1 1 X 0 1 X
0 1 1 X 0 1 1 0 0 X 1 X 1
1 0 X 1 1 0 0 1 1 1 X 1 X
1 1 X 0 1 0 1 0 0 0 X X 1
1 1 0 0 1 X 1 1 X
1 1 1 1 0 X 0 X 1
COUNTER DESIGN
• Use K-map to derive the logic equations

D 0 1 D0 1 0 1 D 0 1
D
AB AB AB AB
00 0 1 00 X X 00 1 1 00 X X
01 1 0 01 X X 01 X X 01 1 1
11 X X 11 1 0 11 X X 11 1 1
10 X X 10 0 1 10 1 1 10 X X

J  = D’B + DB
A
K  = D’B + DB’
A J  = 1
B
K  = 1
B
COUNTER DESIGN
Use the Boolean expressions to implement the counter

CLK

You might also like