DLD-Lab Mannul-2022
DLD-Lab Mannul-2022
Laboratory File
B. Tech. (Computer Engineering)
B. Tech. (Information Technology)
B. Tech. (Information & Communication Technology)
B. Tech. (Electronics & Communication)
B. Tech. (Mechatronics)
Submitted to:
Department of Electronics and Communication
C. G. Patel Institute of Technology,
Bardoli.
DEPARTMENT OF CE/IT/EC/ICT/MECHTRONICS
work and practical work in the subject “DLD/SCLD/DELD” for the term
ending in DEC 2022 at CGPIT, Bardoli for the partial fulfilment of B.Tech.
SEAL OF DEPARTMENT
Nov./Dec. 2022
Index
Sr.
Title Date Signature
No.
THEORY:
Any Gate is a logic circuit with one output and one or more inputs. The output signal of
any gate occurs only for certain combination of input signals. AND, OR and NOT are the
basic gates. Such gates can be prepared by using discrete components like diodes,
transistors, resistors but nowadays different types of IC’s are used to have different
gates. A power supply of +5V is used to give input. This supply is also used to drive ICs.
When power supply to the input is ‘ON’, the logic level is said to be at ‘1’ level and when
power supply to the input is ‘OFF’, the logic level is said to be at ‘0’ level.
AND GATE:
AND gate is a gate, which gives output only when all inputs are present. Here IC7408 is
used which has 2-inputs AND gate. The truth table of AND gate is given in the table.
OR GATE:
OR gate is a gate which gives output when any one of the input is present. Here IC7432
is used which has two input OR gate. The truth table of OR gate is given in the table.
This is also known as INVERTOR gate. This gate has one input and one output. All it does
is invert the input signal i.e. if the input is at high level, the output will be at low level
and vice versa. IC’s 7404 or 7406 can be used to get NOT gate. This IC has one input NOT
gates. The truth table of NOT gate is given in the table.
NAND GATE:
It is a sequence of series combination of AND gate & NOT gate, known as NAND gate.
The output of NAND gate is at ‘0’ level only when all inputs are at ‘1’ level. In rest of all
the conditions of inputs the output will be at ‘1’ level. IC 7400 can be used to get NAND
gate. This IC has two inputs NAND gate. The truth table of NAND gate is given in the
table.
NOR GATE:
It is a sequence series combination of OR gate & NOT gate. The output on NOR gate is at
‘1’ level on when all inputs are at ‘0’ level. In rest all conditions of inputs the output is at
‘0’ level. IC 7402 can be used for NOR gate. The truth table of NOR gate is given in the
table.
EX-OR gate is a gate, which gives output only when both inputs are different. Here
IC74136 is used which has 2-inputs EX-OR gate. The truth table of EX-OR gate is given in
the table.
PROCEDURE:
CONCLUSION:
AIM:Design and implementation of all gates using NAND & NOR gates.
THEORY:
The basic building block of digital systems is known as gates because they control the
passage of signals. Gate is digital circuit with one or more input but only one output. The
gates by use of which the work of other gates can be performed are known as “Universal
gates”. NAND & NOR gates are universal gates.
PROCEDURE:
CONCLUSION:
AIM:To design and implement half adder, half subtractor and both with a select input
circuit.
THEORY:
Digital computers perform variety of tasks. Among them basic arithmetic operations are
additions, subtraction, & multiplication of two binary no. In a combinational circuit, the
addition of two bits without taking into account previous carry is called half adder
circuit.
A combinational circuit that performs subtraction between two bits without taking
borrow is called a half subtractor. It has two inputs and two outputs.
Four inputs are given –Two are the binary inputs for which the sum or the difference is
to be found, one input as end carry &the fourth is the select input. When the select input
is ”1”, the circuit act as half adder & When the select input is ”0”, the circuit act as half
subtractor.
CIRCUIT DIAGRAM:
HALF ADDER
HALF SUBTRACTOR
PROCEDURE:
OBSERVATION:
TRUTH TABLE:
SUM= DIFFERENCE=
CARRY= BORROW=
M
A B
(SELECT SUM/DIFFERENCE CARRY/BORROW
(INPUT-1) (INPUT-2)
LINE)
CONCLUSION:
AIM:To design and implement full adder, full subtractor and both with a select input
circuit.
THEORY:
Digital computers perform variety of tasks. Among them basic arithmetic operations are
additions, subtraction, & multiplication of two binary no. A combinational circuit the
addition of three bits is called full adder circuit (2 significant bits and one end carry).
The third input represents the carry from the lower previous significant position.
A combinational circuit that performs subtraction between two bits taking into account
that “1” may be borrowed by a lower significant stage is called a full subtractor. It has 3
inputs & 2 outputs.
CIRCUIT DIAGRAM:
FULL ADDER
FULL SUBTRACTOR
PROCEDURE:
OBSERVATION:
TRUTH TABLE:
S= D=
C= BR=
A B CN-1 S C A B CN-1 D BR
CONCLUSION:
THEORY:
A parity bit is an extra bit included with message to make the total no. of 1’s either even
or odd. In the sending end, the message applied to a parity generator network where the
required P bit is generated. The message including the parity bit is transferred to its
destination. In the receiving end, all the incoming bits are applied to a parity checker
network to check the proper parity adopted.
CIRCUIT DIAGRAM:
OBSERVATION:
Input Output
X Y Z Pe
Input Output
X Y Z Pe Ce
CONCLUSION:
THEORY:
The availability of a large variety of codes for the same discrete elements of information
results in the use of different codes by different digital system. It is sometimes
necessary to use the output of one system as the input to another. A conversion circuit
must be inserted between the two systems if each uses different codes for the same
information. Thus, a code converter is a circuit that makes the two systems compatible
even though each uses a different binary code.
When there is continuous information with fixed interval it is better to use gray code as
it changes only in one bit if we move from one code to other. Hence it is also known as
reflected gray code. Binary code are given by b3, b2, b1, b0 & Gray code are given by g3,
g2, g1, g0
CIRCUIT DIAGRAM:
OBSERVATION:
CONCLUSION:
AIM:To study the following circuit and verify their truth table.
1. 4 To 1 line Multiplexer.
2. 1 To 4 line De-Multiplexer.
THEORY:
A De-multiplexer is a circuit that receives information on a single line and transmits this
information on one of 2n possible output lines. The selection of a specific output line is
controlled by the bit values of n selection lines.
CIRCUIT DIAGARAM:
4 TO 1 LINE MULTIPLEXER
1 TO 4 LINE DE-MULTIPLEXER
OBSERVATION:
CONCLUSION:
AIM: To study the following circuit and verify their truth table.
1. 3×8 Decoder
2. 8×3 Encoder
THEORY:
Discrete quantities of information are represented in digital systems with binary codes.
2n distinct elements can be represented by a binary code of n bits. An encoder has 2n
input lines and n output lines. The output lines generate the binary code for the 2 n input
variables. The 8 to 3 line encoder consists of eight inputs D0-D7, and three outputs X, Y,
Z that generates the corresponding binary number.
CIRCUIT DIAGRAM:
8 TO 3 LINE ENCODER
PROCEDURE:
OBSERVATION:
8 TO 3 LINE ENCODER
INPUT OUTPUT
D0 D1 D2 D3 D4 D5 D6 D7 X Y Z
INPUT OUTPUT
X Y Z D0 D1 D2 D3 D4 D5 D6 D7
CONCLUSION:
THEORY:
In this flip flop three inputs are used i.e. S, R and clock input. Here negative triggering is
used i.e. flip flop will be activated when the clock goes from ‘1’ to ‘0’. Now when both S-R
inputs are same the output will remain in the previous state. When S=1 and R=0, flip
flop will be in set mode i.e. Q=1. When R=1 and S=0, it will be in reset mode i.e. Q=0.
Now when both are 1, then basic definition of output is violated and consider the state
as indeterminate.
The inputs to this flip flop are J, K, CLK, preset and clear. The two outputs are
complement of each other. This requires four 3 input gates for implementation. For
working of this flip flop the preset and clear should be at logic 1. The JK flip flop IC 7476
is a negative edge triggered. The state will change only when the clock pulse changes
from 1 to 0.
D FLIP FLOP:
In this flip flop one signal is provided to one input and its inverted version is given to
other input. The D flip-flop captures the value of the D-input at a definite portion of the
clock cycle (such as the rising edge of the clock). That captured value becomes the Q
output. i.e. when D=1, Q=1 and when D=0, Q=0.
T FLIP FLOP:
When both input of JK flip flop are 1 then output will toggle between 0 and 1. This is
called T- flip flop.
S-R FLIP-FLOP:
J-K FLIP-FLOP:
D FLIP-FLOP:
T FLIP-FLOP:
OBSERVATION:
S R Qn+1 J K Qn+1
D FLIP-FLOP: T FLIP-FLOP:
D Qn+1 T Qn+1
CONCLUSION:
THEORY:
A register is a group of binary storage cells suitable for holding binary information. A
group of flip-flops constitute a register, since each flip flop is a binary cell capable of
storing one bit of information. An n-bit register has a group of n flip-flops and is capable
of storing any binary information containing n bits. In addition to the flip flops, a
register may have combinational gates that perform certain data processing tasks like
when and how new information is transferred in to the register.
A register is capable of shifting its binary information either to the right or to the left is
called a shift register. The logical configuration of a shift register consists of a chain of
flip-flops connected in cascade, with the output of one flip-flop connected to the input of
next flip-flop. All flip flops receive a common clock pulse, which causes the shift from
one stage to the next.
In 4 bit serial in -parallel out shift register the, Q output of a given flip-flop is connected
to the D input of the flip-flop at its right. Each clock pulse shifts the contents of the
register one bit position to the right. The serial input determines what goes into the
leftmost flip flop during the shift. The serial output is taken from the output of rightmost
flip-flop prior to the application of pulse. The register shifts its contents with every
clock during the positive edge of the pulse transition.
CIRCUIT DIAGRAM:
OBSERVATION:
CONCLUSION:
THEORY:
In synchronous counter, the clock pulse is applied to all the flip flops and triggers them
simultaneously. The design of such counter is carried out using synchronous sequential
circuit. When counting reaches at 10 the next state will be 00. Then the counting
sequence starts again.
In synchronous counter, the external clock signal is connected to the clock input of
every individual flip-flop within the counter so that all of the flip-flops are clocked
together simultaneously (in parallel) at the same time giving a fixed time relationship.
In other words, changes in the output occur in "synchronization" with the clock signal.
This results in all the individual output bits changing state at exactly the same time in
response to the common clock signal with no ripple effect and therefore, no propagation
delay.
Synchronous counters can be made from Toggle or D-type flip flops. They are called
synchronous counters because the clock input of the flip flops are clocked with the same
clock signal. Due to the same clock pulse all outputs change simultaneously.
Synchronous counters are also called parallel counters as the clock is fed in parallel to
all flip flops. Synchronous binary counters use both sequential and combinational logic
elements. The memory section keeps track of the present state. The sequence of the
count is controlled by combinational logic.
CIRCUIT DIAGRAM
3-BIT UP COUNTER
PROCEDURE:
1. Connections are made as per the circuit diagram.
2. Switch on the power supply.
3. Apply clock pulses and note the outputs after each clock pulse.
OBSERVATION:
3-BIT UP COUNTER:
DESIGN CALCULATION:
DESIGN CALCULATION:
CONCLUSION:
THEORY:
A Johnson counter is a modified twisted ring counter, where the output from the last
stage is inverted and fed back as input to the first stage. A pattern of bits equal in length
to twice the length of the shift register thus circulates indefinitely. These counters find
specialist applications, including those similar to the decade counter, digital to analog
conversion, etc.
CIRCUIT DIAGRAM:
PROCEDURE:
CLOCK Q1 Q2 Q3 Q4
0
1
2
3
4
5
6
7
8
CONCLUSION: