DLD Lab Manual FA24 g2 (Final)
DLD Lab Manual FA24 g2 (Final)
FA23-BSE-088
2 Mubeen Ahmad
FA23-BSE-205
4 Hadeeq
Acknowledgement
Contribution of the following faculty members is highly appreciated:
Engr. Syed Junaid Akhtar
Engr. Wajeeha Khan
Engr. Sara Sajid
Engr. Abdul Moeed
Books
Text Books
Reference Books
Theory CLOs:
1. CLO1: Comprehend the working with different number systems, Boolean algebra and mapping methods
using standard mathematical rules. (PLO1-C2)
2. CLO2: Analyze the working of combinational and sequential logic circuits using digital logic principles
and Boolean algebra. (PLO2-C4)
3. CLO3: Plan and design the combinational and sequential logic circuits using digital logic principles,
Boolean algebra and mapping methods. (PLO3-C5)
Lab CLOs:
4. CLO4: To analyze and design the combinational and sequential logic circuits using software and
hardware platforms. (PLO3-C5)
5. CLO5: Follow the software and hardware tools to reproduce the response of the digital logic circuits
using software and hardware platforms. (PLO5-P3)
6. CLO6: To explain and write effective lab reports of experiments performed during lab (PLO10-A3)
Grading Policy
The final marks for lab would comprise of Lab Assessment (25%), Lab S1 (10%), Lab S2 (15 %) and Lab
Terminal (50%).
S-I 0.5*(S-I Exam result) + 0.5* (average of lab evaluation of Lab 1-4)
S-II 0.5*(S-II Exam result) + 0.5*[ (average of lab evaluation of Lab 5-8) * 1.5]
Terminal 0.1*[(OEP marks out of 25)*2] +0.4*(Terminal Exam result out of 50) +0.25*[(average of
lab evaluation of Lab 9-12) *5] + 0.10*[(average of lab evaluation of Lab 5-8) *5] + 0.15*[(average
of lab evaluation of Lab 1-4) *5]
Software Resources
Proteus Professional 6.9
Lab Instructions
• This lab activity comprises of three parts: Pre-lab, Lab Tasks, Post Lab Tasks, Lab Report and
Conclusion and Viva session.
• The students should perform and demonstrate each lab task separately for step-wise evaluation.
• Only those tasks that are completed during the allocated lab time will be credited to the students.
• Students are however encouraged to practice on their own in spare time for enhancing their skills.
Preface ii
Acknowledgement ii
Books iii
Grading Policy iv
List of Equipment v
Software Resources v
Lab Instructions v
LAB # 1: To Identify the Responses of Different Logic Gates using Hardware and Software Platforms 11
Objectives 11
Pre Lab 11
In- Lab 12
Post LAB: 21
LAB # 2: To Explain the Universality of NAND and NOR GATES in Order to Design Other Logic Gates 23
Objectives 23
Pre-Lab: 23
In-Lab 23
Post-Lab: 28
LAB # 3: To Show the output of simplified Boolean Expression by following the k-map, using Hardware and
Software Platforms 30
Objectives 30
Pre-Lab 30
In-Lab 31
Objectives 36
Pre-Lab 36
Part 1 -Familiarize yourself with Half Adder & Full Adder 36
In-Lab 37
Post-Lab: 43
LAB # 5: To Follow the Steps of BCD to Excess 3 Code Conversion and Reproduce the Results using Dedicated IC
45
Objectives 45
Pre Lab 45
Part 1 -Familiarize yourself with BDC to Excess-3 45
Part 2 -Familiarize yourself with Excess-3 to BCD 45
In Lab 45
Post Lab 45
LAB # 6: To Follow the Steps of Binary to Gray Code Conversion and Reproduce the Results using Logic Gates 49
Objectives 49
Pre Lab 49
In-Lab 49
Post Lab: 53
Post Lab: 68
LAB # 9: To Show the response of an Encoder/Decoder and to Reproduce the binary converters using basic logic
gates 70
Objectives 79
Pre Lab 79
In Lab 79
Post Lab: 83
LAB # 11: To show the Response of Shift Registers using 7495 IC and Reproduce the shift registers using D-Flip-
Flops 85
Objectives 86
Pre Lab 86
In Lab 86
Post Lab
87
LAB # 12: To Reproduce a Synchronous Sequence Detector using hardware and software tools 89
Objectives 89
Pre Lab 89
In Lab 89
Post Lab
89
LAB # 13: To Show the Response of Ring and Johnson Counter using 7495 IC 94
Objectives 94
Pre Lab 94
In Lab 94
Post Lab
95
LAB # 14: To Reproduce the Asynchronous Counters using hardware and software tools 97
Objectives 97
Pre Lab 97
Part 1 -Familiarize yourself with Asynchronous Counter: 97
Part 2 -Familiarize yourself with Synchronous Counter: 97
In Lab: 97
∙ To identify various ICs used in proteus software and to perform basic functionality of
logic gates
Pre Lab
These basic logic gates are implemented as small-scale integrated circuits (SSICs) or as part of
more complex medium scale (MSI) or very large-scale (VLSI) integrated circuits. Digital IC
gates are classified not only by their logic operation, but also the specific logic-circuit family to
which they belong. Each logic family has its own basic electronic circuit upon which more
complex digital circuits and functions are developed. The following logic families are the most
frequently used.
TTL and ECL are based upon bipolar transistors. TTL has a well-established popularity among
logic families. ECL is used only in systems requiring high-speed operation. MOS and CMOS,
are based on field effect transistors. They are widely used in large scale integrated circuits
because of their high component density and relatively low power consumption. CMOS logic
consumes far less power than MOS logic. There are various commercial integrated circuit chips
available. TTL ICs are usually distinguished by numerical designation as the 5400 and 7400
series.
Read and understand pin configuration and list the truth tables of AND, OR, NOT, NAND,
In- Lab
Lab Tasks-Part-A
Study and verify the truth table of logic gates
Lab Task 1:
0 1 1
IC 7400 NAND gate
1 0 1
1 1 0
Fig:
1.1
0 0 1
Table:
1.1
Inputs Output
Lab Task 2: A B
IC 7408 AND gate
0 0 0
0 1 0
Fig: 1.2
1 0 0
Inputs Output
A B 1 1 1
0 0 Table: 1.2
0 1
1 0
Fig: 1.3
Table:
1.3
Inputs Output
Lab Task 4: A B
0 1 0
1 0 0
Fig: 1.4
1 1 0
A B
0 0 0
Fig: 1.5
Input Output 0 1 1
Table: 1.5
1 1 1 1 0 1
Lab Task 6:
Fig: 1.6
A B
0 0 0
Table: 1.6
0 1 1
ARES PCB Layout - PCB design system with automatic component placer, rip-up and retry auto-router
and interactive design rule checking.
VSM - Virtual System Modelling lets co-simulate embedded software for popular micro controllers
alongside hardware design.
System Benefits
Integrated package with common user interface and fully context sensitive help. But we only use
the ISIS Schematic Capture
In Lab:
Lab Tasks-Part-B
Right click on the ISIS icon present on desktop and then open it.
Fig: 1.7
Lab Task 1:
0 0 0
0 1 0
Fig: 1.9
1 0 0
1 1 1
Fig: 1.10
Fig: 1.11
Connect the components and save the design by specific name
Fig: 1.12
Press the “start” button to execute the design and verify the results
Fig: 1.13
Repeat the same procedure for the followings Gates.
Lab Task 2:
A B
Fig: 1.14
0 0 0
0 1 1
1 0 1
1 1 1
Table: 1
Lab Task 4:
Inputs Output
A B
0 0 1
0 1 1
1 0 1
1 1 0
Lab Task 5:
A B
0 0 O
0 1 1
1 0 1
1 1 0
Draw the schematic for following logic circuit in Proteus and fill in the table. Answer the
questions at the end.
A B C D F1 F2
0 0 0 0 0 0
0 0 0 1 1 1
0 0 1 0 1 0
0 0 1 1 1 1
0 1 0 0 1 1
0 1 0 1 0 1
0 1 1 0 1 1
1 0 0 0 1 0
1 0 0 1 1 1
1 0 1 0 1 0
1 0 1 1 1 1
1 1 0 0 1 0
1 1 0 1 1 1
1 1 1 0 1 0
1 1 1 1 1 1
Table: 1.12
XOR:
XNOR:
The student performance for the assigned task during the lab session was:
Excellent The student completed assigned tasks without any help from the 4
instructor and showed the results appropriately.
Good The student completed assigned tasks with minimal help from 3
the instructor and showed the results appropriately.
Average The student could not complete all assigned tasks and showed 2
partial results.
Pre-Lab:
Background theory:
Digital circuits are more frequently constructed with NAND or NOR gates than with AND and OR
gates. NAND and NOR gates are easier to fabricate with electronic components and are the basic
gates used in all IC digital logic families. Because of the prominence of NAND and NOR gates in
Read and understand the universal gates also list the truth tables of AND, OR, NOT, NAND, NOR
and XOR gates.
In-Lab
Procedure
✔ Use any one or more of the NAND gates of the IC for this experiment.
✔ Any one or more Logic Switches of the trainer (S1 to S9) can be used for input to the NAND gate.
✔ For output indication, connect the output pin of the circuit to any one of the LEDs of the trainer (L0 to
L15).
Lab Tasks-Part-1
Lab Task 1:
✔ Connect +5V to pin 14 (Vcc) and Ground to pin 7 (GND) of the IC.
Lab Task 2
Verification of OR function
✔ Connect +5V to pin 14 (Vcc) and Ground to pin 7 (GND) of the IC.
✔ By setting the switches to 1 and 0, verify that the output of the circuit conforms to that of an OR gate. Record
your observation in the table below
A B output
0 0 0
0 1 0
1 0 0
1 1 1
gate. Recor
A B
0 0 0
0 1 1
1 1 1
Table: 2.2
Lab task 3
✔ Connect +5V to pin 14 (Vcc) and Ground to pin 7 (GND) of the IC.
✔ By setting the switch to 1 and 0, verify that the output of the circuit conforms to that of a NOT gate. Record
Output
Input
0 1
1 0
Table: 2.3
Part 2 - Implementing any logic expression by using only NOR gates
NOR function is the dual of the NAND function, hence all procedure and rules for NOR logic form a
dual of the corresponding procedures and rules developed for the NAND logic. Figure
2.1 below shows how NOR gates can be used to create AND, OR, and INVERTER gates.
Procedure
✔ Use any one or more of the NOR gates of the IC for this experiment.
✔ Any one or more Logic Switches of the trainer (S2 to S9) can be used for input to the NOR gate.
✔ For output indication, connect the output pin of the circuit to any one of the LEDs of the trainer (L0 to
L15).
Lab Tasks-Part-2
Lab Task 1:
0 0 0
0 1 0
1 0 0
1 1 1
Lab task 2:
Verification of OR function
✔ Connect +5V to pin 14 (Vcc) and Ground to pin 7 (GND) of the IC.
✔ By setting the switches to 1 and 0, verify that the output of the circuit conforms to that of an OR gate.
Record your observation in the table below
0 0 0
0 1 1
1 0 1
1 1 1
Lab task 3
✔ Connect +5V to pin 14 (Vcc) and Ground to pin 7 (GND) of the IC.
Inputs A Outputs
A’
0 1
1 0
✔ By setting the switch to 1 and 0, verify that the output of the circuit conforms to that of an
NOT gate. Record your observation in the table below
NOR Gate:
XOR GATE:
2- Design NAND, XOR and XNOR gate Using NOR gate only.
NAND Gate:
XOR GATE:
• To display the Boolean expression in its simplified form using Karnaugh map
• To display the results of simplified Boolean expression using hardware and software
platforms
A Boolean function can be represented by a Karnaugh map in which each cell corresponds to a
minterm. The cells are arranged in such a way that any two immediately adjacent cells correspond
to two minterms of distance 1. There is more than one way to construct a map with this property.
Karnaugh Maps
For a function of two variables, say, 𝑓 (𝑥, 𝑦),
In-Lab Lab
Tasks-Part-1
Lab Task 1:
Realization of Boolean expression:
TRUTH TABLE
INPUTS OUTPUT
A B C D Y
0 0 0 0 0
0 0 0 1 0
0 0 1 0 1
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 1 0
1 1 1 0 1
1 1 1 1 0
Table: 3.1
Y= A'B'CD' + A'BCD' + AB'C'D' + AB'C'D + AB'CD' + AB'CD + ABCD'
CD AB
1 1 1 1
𝑌 = 𝐴𝐵′ + 𝐶 𝐷'
Lab Task 2:
For the given truth table simplify the Boolean expression by using K-Map
Truth Table
Inputs Output
A B C D Y
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 0
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
Lab Tasks-Part-2
Lab Task 1:
Implement the following simplified function by using basic gates as mention in Task 1 Part 1
𝑌 = 𝐴𝐵′ + 𝐶 𝐷'
Part 2:
Task 1:
Post-Lab
Implement the Task 2 of Part 1 by using universal gates (NAND & NOR).
0 0 0 0 0 0
0 0 1 0 1 1
1 0 1 1 1 1
1 1 1 0 1 1
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
Pre-Lab
A combinational logic circuit that performs the addition of two data bits, A and B, is called a
half-adder. Addition will result in two output bits; one of which is the sum bit, S, and the other
is the carry bit, C. The Boolean functions describing the half-adder are:
S =A B
C =AB
Full Adder
The half-adder does not take the carry bit from its previous stage into account. This carry bit
from its previous stage is called carry-in bit. A combinational logic circuit that adds two data
bits, A and B, and a carry-in bit, Cin, is called a full-adder. The Boolean functions describing the
full-adder are:
S = (x y) Cin
C = xy + Cin (x y)
Half Subtractor
Subtracting a single-bit binary value B from another A (i.e. A-B) produces a difference bit D and
a borrow out bit B-out. This operation is called half subtraction and the circuit to realize it is
called a half subtractor. The Boolean functions describing the half-Subtractor are:
S =A B
C = A’ B
Full Subtractor
D = (x ⊕ y) ⊕ Cin
In-Lab
Lab Tasks-Part-1
Lab Task 1
Implement half adder by using basic gates and verify the results
Fig: 4.1
Truth Table
OUTPUTS
INPUTS
Observed Values
A B S C
0 0
0 1
1 0
1 1
Table: 4.1
Lab Task 2:
Fig: 4.2
Truth Table
OUTPUTS
INPUTS
Observed Values
A B S C
0 0
0 1
1 0
1 1
Table: 4.2
Lab Task 3
Implement full adder by using basic gates and verify the results
Truth Table
Table: 4.3
Lab Task 4
Implement full adder by using NAND gates and verify the results
Fig: 4.4
Truth Table
Lab Tasks-Part-2
Lab Task 1
Implement half subtractor by using basic gates and verify the results
Fig: 4.5
Truth Table
OUTPUTS
INPUTS
Observed Values
A B D Br
0 1
1 0
1 1
Table: 4.5
Lab Task 2:
Fig: 4.6
Truth Table :
Table: 4.6
Lab Task 3:
Implement full subtractor by using basic gates and verify the results
Truth Table:
Table: 4.7
Lab Task 4
Implement full subtractor by using NAND gates and verify the results
Truth Table
Table: 4.8
Post-Lab:
Design half adder, full adder, half subtractor and full subtractor using NOR gates.
Full Adder
Half Subtractor
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.
Pre Lab
In Lab
Lab Tasks-Part-1
Lab Task 1
Fig. 5.1
Table: 5.1
Lab Tasks-Part-2
Lab Task 2:
Truth Table
Post Lab
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.
Pre Lab
Lab Tasks-Part-1
Binary Code to Gray Code Conversion
Boolean Expressions:
G3=B3; G2=B3 B2
G1=B1 B2; G0=B1 B0
Lab Tasks-Part-2
|EEE 241 | Digital Logic Design Lab Manual 52
Gray Code to Binary Code Conversion
Boolean Expressions:
B3=G3; B2=G3 ⊕ G2
B1=G3 ⊕ G2 ⊕ G1; B0=G3 ⊕ G2 ⊕ G1 ⊕ G0
Lab Task 1:
Fig: 6.1
Truth Table
Binary Gray
B3 B2 B1 B0 G3 G2 G1 G0
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
Fig: 6.2
Fig: 6.3
Truth Table
Gray Binary
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
Pre Lab
In lab
4:1 Multiplexer
S1 S0 E I0 I1 I2 I3 Y
X X 1 X X X X
0 0 0 0 X X X
0 0 0 1 X X X
0 1 0 X 0 X X
0 1 0 X 1 X X
1 0 0 X X 0 X
1 0 0 X X 1 X
1 1 0 X X X 0
1 1 0 X X X 1
Table: 7.1 Lab Task 3:
Tasks-Part-2 Lab
Task 1:
Lab Task 2:
Truth Table
E D S1 S0 Y3 Y2 Y1 Y0
1 0 X X
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
Table: 7.3
Lab Task 3:
Fig: 7.4
Inputs Outputs
Ea S1 S0 Y3 Y2 Y1 Y0
1 X X
0 0 0
0 0 1
0 1 0
0 1 1
Table: 7.4
Lab Tasks-Part-3
Lab Task 1: Half Adder using MUX:
Design:
SUM CARRY
I0 I1 I0 I1
0 1 0 1
2 3 2 3
A A’ 0 A
Circuit Diagram:
Fig: 7.5
Truth Table:
Table: 7.5
Design:
SUM
I0 I1 I2 I3
0 1 2 3
4 5 6 7
A A’ A’ A
CARRY
I0 I1 I2 I3
0 1 2 3
4 5 6 7
0 A A 1
Circuit Diagram:
Fig: 7.6
Table: 7.6
Lab Task 3: Half Subtractor using MUX:
Design:
DIFFERENCE BORROW
I0 I1 I0 I1
Circuit Diagram:
Fig: 7.7
Truth Table:
Design:
Circuit Diagram:
Table: 7.8
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.
Pre Lab
In Lab:
Lab Tasks-Part-1
Circuit Diagram:
Fig: 8.1
Truth Table:
Circuit Diagram:
Truth Table:
Lab Tasks-Part-2
Lab Task 1: 4-Bit Comparator
Circuit Diagram:
Fig: 8.3
Truth Table:
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
• To explain the basic functionality and working of Encoder using logic gates
• To explain the basic functionality and working of decoder using logic gates
• To display the results of various applications of encoder using hardware and
software platforms
• To display the results of various applications of decoder using hardware and
software platforms
Pre Lab
The IC 74139 accepts two binary inputs and when enable provides 4 individual active low outputs. The
device has 2 enable inputs (Two active low).
The Light Emitting Diode (LED), finds its place in many applications in this modern electronic fields.
One of them is the Seven Segment Display. Seven-segment displays contain the arrangement of the
LEDs in “Eight” (8) passion, and a Dot (.) with a common electrode, lead (Anode or Cathode). The
LED’s are basically of two types- Common Cathode (CC) -All the 8 anode legs uses only one
cathode, which is common. Common Anode (CA)-The common leg for the entire cathode is of
Anode type.
A decoder is a combinational circuit that connects the binary information from ‘n’ input lines to
a maximum of 2n unique output lines. The IC7447 is a BCD to 7-segment pattern converter. The
IC7447 takes the Binary Coded Decimal (BCD) as the input and outputs the relevant 7 segment
code.
An encoder performs a function that is the opposite of decoder. It receives one or more signals
in an encoded format and output a code that can be processed by another logic circuit. One of
the advantages of encoding data, or more often data addresses in computers, is that it reduces
the number of required bits to represent data or addresses. For example, if a memory has 16
different locations, in order to access these 16 different locations, 16 lines (bits) are required if
the addressing signals are in 1 out of n format. However, if we code the 16 different addresses
into a binary format, then only 4 lines (bits) are required. Such a reduction improves the speed
of information processing in digital systems.
In Lab:
Lab Tasks-Part-1
2:4 DECODER (MIN TERM GENERATOR):
Truth Table:
Expressions:
Circuit Diagram:
Fig: 9.1
TRUTH TABLE:
Table: 9.2
CIRCUIT DIAGRAM:
Lab Tasks-Part-2:
CIRCUIT DIAGRAM:
Fig: 9.3
TRUTH TABLE:
Decimal
Output Logic Levels from IC 7447 to 7-
segments number
BCD Inputs display
D C B A a b c d e f g
0 0 0 0 0 0 0 0 0 0 1
0 0 0 1 1 0 0 1 1 1 1
0 0 1 0 0 0 1 0 0 1 0
0 0 1 1 0 0 0 0 1 1 0
0 1 0 0 1 0 0 1 1 0 0
0 1 0 1 0 1 0 0 1 0 0
Lab Tasks-Part-3:
Table: 9.4
CIRCUIT DIAGRAM:
Fig: 9.4
Fig: 9.5
Truth Table:
Table: 9.5
Table: 9.6
Lab Tasks-Part 2:
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.
Pre Lab
SR LATCH
S-R latch consists of two cross-coupled NOR gates. An S-R flip-flop can also be design using
cross-coupled NAND gates as shown. The truth tables of the circuits are shown below. A
clocked S-R flip-flop has an additional clock input so that the S and R inputs are active only
when the clock is high. When the clock goes low, the state of flip-flop is latched and cannot
change until the clock goes high again. Therefore, the clocked S-R flip-flop is also called
“enabled” S-R flip-flop. A D latch combines the S and R inputs of an S-R latch into one input
by adding an inverter. When the clock is high, the output follows the D input, and when the
clock goes low, the state is latched.
In Lab Lab
Task 1:
S-R LATCH:
Table: 10.1
Lab Task 2:
SR FLIP FLOP:
TRUTH TABLE
Table: 10.2
Lab Task 3:
CONVERSION OF SR-FLIP FLOP TO T-FLIP FLOP (Toggle)
LOGIC DIAGRAM SYMBOL
Table: 10.3
Lab Task 4:
Fig:10.4
CLOCK D Q+ Q’
0 X
1 0
1 1
Table: 10.4
Table: 10.6
Fig: 10.6
Table: 10.7
Post Lab:
Differentiate between different types of FLIP FLOPS.
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.
Objectives
1. To explain the working of a shift register using 7495 IC
2. To differentiate between the different types of shift register
Pre Lab
In digital circuits, a shift register is a cascade of flip flops, sharing the same clock, in which the
output of each flip-flop is connected to the "data" input of the next flip-flop in the chain, resulting
in a circuit that shifts by one position the "bit array" stored in it, shifting in the data present at its
input and shifting out the last bit in the array, at each transition of the clock input.
More generally, a shift register may be multidimensional, such that it’s "data in" and stage outputs
are themselves bit arrays: this is implemented simply by running several shift registers of the
same bit-length in parallel.
Shift registers can have both parallel and serial inputs and outputs. These are often configured as
'serial-in, parallel-out' (SIPO) or as 'parallel-in, serial-out' (PISO). There are also types that have
both serial and parallel input and types with serial and parallel output. There are also
'bidirectional' shift registers which allow shifting in both directions: L→R or R→L. The serial input
and last output of a shift register can also be connected to create a 'circular shift register'.
In Lab
1. Check all the components for their working
2. Insert the appropriate IC into the IC base
3. Make connections as shown in the circuit diagram
4. Verify the Truth Table and observe the outputs
Fig: 11.1
Lab Task 1:
SERIAL IN SERIAL OUT (SISO) (Right Shift)
Serial Shift
QA QB QC QD
i/p data Pulses
- -
0 t1
1 t2
0 t3
1 t4
Table: 11.2
Lab Task 3:
PARALLEL IN PARALLEL OUT (PIPO)
Clock
Shift
Input QA QB QC QD
Pulses
Terminal
- -
CLK2 t1
Table: 11.3
Lab Task 4
PARALLEL IN SERIAL OUT (PISO)
Clock
Shift
Input QA QB QC QD
Pulses
Terminal
- -
1 t4
X t5
Table: 11.4
Post Lab:
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
Pre Lab
A sequence detector is a sequential logic circuit that can be used to detect whether a given
sequence of bits has been received or not by a receiver. Consider, for example, a single-input
single-output sequence detector. Let the sequence to be detected be 101. Repetition is allowed in
this sequence. This means that, the circuit will give an output of I when it detects first the
sequence 101 in a series of incoming bits. Let the next two bits after the first 101 be 01. We find
that the circuit will read this as 101 and output another 1. This is because we have given
permission for repetition, and the circuit will consider the last 1 in the first 101 as a valid first 1
in the next sequence of 101.
In Lab
Procedure
1. Draw the state diagram of the state machine below and show it to the lab instructor.
5. Draw the circuit diagram using NAND GATES ONLY for the state machine
State Diagram
State Table
QA QB QC Y DA DB DC
0 0 0 0 0
0 0 0 1 1
0 0 1 0 2
0 0 1 1 3
0 1 0 0 4
0 1 0 1 5
0 1 1 0 6
Q CY QCY
Q AQ B 00 01 11 10 Q AQ B 00 01 11 10
00 00
01 01
11 11
10 10
For
QCY
Q AQ B 00 01 11 10
00
01
11
10
Table: 12.2
State Equations
DA = DB =
DC =
D Q
CLK
D Q
CLK
D Q
CLK
Fig: 12.1
Implementation
Connect the circuit according to your design and check for the following input
sequence.
Table: 12.3
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.
Pre Lab
In Lab Lab
Task-1
Circuit Diagram:
Fig: 13.1
Truth Table:
Clock
QA QB QC QD
pulses
0
1
Table: 13.1
Lab Task-2:
Circuit Diagram :
Fig: 13.1
Truth Table :
Clock Q Q Q Q
Pulses A B C D
0
1
2
3
4
5
6
7
8
Table: 13.1
Post Lab:
Pre Lab
In Lab:
Mod 8 up counter
Circuit Diagram
Fig: 14.1
TRUTH TABLE
Mod_ 6 up counter
Circuit Diagram:
Fig: 14.2
TRUTH TABLE
Table: 14.2
Fig: 14.3
TRUTH TABLE
Table: 14.3
Mod_ 6 down counter
Circuit Diagram:
Table: 14.4
PROCEDURE:
1) Check all the components for their working.
Table: 14.6
Table: 14.7
Circuit Diagram:
Table: 14.8
Table: 14.8
Post Lab:
The student performance for the assigned task during the lab session was:
The student completed assigned tasks without any help from the
Excellent 4
instructor and showed the results appropriately.
The student completed assigned tasks with minimal help from the
Good 3
instructor and showed the results appropriately.
The student could not complete all assigned tasks and showed
Average 2
partial results.