0% found this document useful (0 votes)
22 views4 pages

Experiment 10 Verification of Basic Logic Gates & Study of Adder and Substractor

It is the experiment performed in the basic electronics engineering of 4th semester related to logic gates

Uploaded by

Susmitha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
22 views4 pages

Experiment 10 Verification of Basic Logic Gates & Study of Adder and Substractor

It is the experiment performed in the basic electronics engineering of 4th semester related to logic gates

Uploaded by

Susmitha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 4

Experiment 9:

Verification of Basic Logic Gates


Verification of basic logic gates
Verification and interpretation of truth tables for AND, OR, NOT, NAND, NOR Exclusive OR
(EX-OR) Gates. Implement AND, OR, NOT functions using universal gates NAND & NOR
Apparatus: Universal Work Station, logic gates ICs, wires,2mm banana connectors
Theory: Logic gates are electronic circuits which perform logical functions on one or more inputs
to produce one output. When all the input combinations of a logic gate are written in a series and
their corresponding outputs written along them, then this input/ output combination is called
Truth Table.
Procedure:
1.Connect the VCC +5v to the IC pin 14 w.r.t Ground pin 7.
2.Connect the inputs of logic gate to the logic switches and its output to the logic indicator (LED).
3.Apply various input combinations and observe output for each one.
4.Verify the truth table for each input/ output combination.
5.Repeat the process for all other logic gates.
AND Gate (7408)
AND gate produces an output as 1, when all its
inputs are 1; otherwise, the output is 0. This gate
can have minimum 2 inputs but output is always
one. Its output is 0 when any input is 0.

OR Gate (7432)
OR gate produces an output as 1, when any or all
its inputs are 1; otherwise, the output is 0. This
gate can have minimum 2 inputs but output is
always one. Its output is 0 when all input is 0.

NOT Gate (7404)


NOT gate produces the complement of its input.
This gate is also called an INVERTER. It always
has one input and one output. Its output is 0 when
input is 1 and output is 1 when inputs are 0.

NAND Gate (7400)

NAND gate is actually a series of AND gate


with NOT gate. If we connect the output of an
AND gate to the input of a NOT gate, this
combination will work as NOT-AND or
NAND gate. Its output is 1 when any or all
inputs are 0, otherwise output is 1.
NOR Gate (7402)

NOR gate is actually a series of OR gate with NOT gate. If we connect the output of an OR gate to
the input of a NOT gate, this combination will work as NOT-OR or NOR gate. Its output is 0 when
any or all inputs are 1, otherwise output is 1.

Exclusive OR (X-OR) Gate (7486)

X-OR gate produces an output as 1, when number of 1’s at its inputs is odd, otherwise output is 0. It
has two inputs and one output.

 Implement All BASIC Gates using the universal gate (NAND & NOR).
Adder and Subtractor
Half adder

Here the output ‘1’of ‘10’ becomes the carry-out. The result is shown in a truth-table below. ‘SUM’
is the normal output and ‘CARRY’ is the carry-out. From the equation it is clear that this 1-bit adder
can be easily implemented with the help of XOR Gate for the output ‘SUM’ and an AND Gate for
the carry. For complex addition, there may be cases when you have to add two 8-bit bytes together.
This can be done only with the help of full-adder logic.
Full Adder: - This type of adder is a little more difficult to implement than a half-adder. The
main difference between a half-adder and a full-adder is that the full-adder has three inputs and two
outputs. The first two inputs are A and B and the third input is an input carry designated as CIN. The
output carry is designated as COUT and the normal output is designated as S. Take a look at the truth-
table.

From the above truth-table, the full adder logic can be implemented. We can see that the output S is
an EXOR between the input A and the half-adder SUM output with B and CIN inputs. We must also
note that the COUT will only be true if any of the two inputs out of the three are HIGH.

The sum (S) of the full-adder is the XOR of A, B, and Cin. Therefore,
Sum, S=A⊕B⊕Cin=A′B′Cin+A′BC′in+AB′C′in+ABCin
The carry (Cout) of the half-adder is the AND of A and B. Therefore,
Carry, Cout =AB+ACin+BCin
Subtractor: Subtractor is the one which used to subtract two binary number(digit) and
provides Difference and Borrow as an output. In digital electronics we have two types of subtractor.
1.Half Subtractor
2.Full Subtractor
1.Half Subtractor: Half Subtractor is used for subtracting one single bit binary digit from another
single bit binary digit. The truth table of Half Subtractor is shown below.

Logic Diagram

Like Adders Here also we need to calculate the equation of Difference and Borrow
Difference=A'B+AB'=A⊕B
Borrow=A'B

2. Full Subtractor: A logic Circuit Which is used for Subtracting Three Single Bit Binary digit is
known as Full Subtractor. The Truth Table of Full Subtractor is Shown Below.
LOGIC DIAGRAM

From_the_Truth_Table_the_Difference_and_Borrow_will_written_as
Difference=A'B'C+A'BB'+AB'C'+ABC=A⊕B⊕C
Reduce_it_like_adder_Then_We_got
Difference=A⊕B⊕C
Borrow=A'B'C+A'BC'+A'BC+ABC
=A'B'C+A'BC'+A'BC+A'BC+A'BC+ABC---------->A’BC=A'BC+A'BC+A'BC
=A'C(B'+B)+A'B(C'+C)+BC(A'+A)
Borrow=A'C+A'B+BC

You might also like