Scribd
Upload
15 views7 pages

Download

The document outlines an experiment to realize basic logic gates (AND, OR, NOT, XOR, XNOR) using universal gates (NAND and NOR). It provides a list of apparatus required, theoretical background on NAND and NOR gates, and truth tables for each logic gate implemented. The conclusion emphasizes that universal gates can construct all basic logic gates, confirming the alignment of theoretical Boolean algebra with experimental results.

Uploaded by

Sourabh Paul Sphs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views7 pages

Download

The document outlines an experiment to realize basic logic gates (AND, OR, NOT, XOR, XNOR) using universal gates (NAND and NOR). It provides a list of apparatus required, theoretical background on NAND and NOR gates, and truth tables for each logic gate implemented. The conclusion emphasizes that universal gates can construct all basic logic gates, confirming the alignment of theoretical Boolean algebra with experimental results.

Uploaded by

Sourabh Paul Sphs
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

REALISATION OF BASIC GATES USING UNIVERSAL GATES

OBJECT: To realize the basic logic gates using universal logic gates (NAND
& NOR).

APARATUS:

Sl. Name Make Model no. Specification


No.
1. Regulated power ELNOVA E-61 0-30V, 2A;
supply ±3V,±15V,1A,5V,
5A
2. Logic probe Made in Model-625 50 MHz
Taiwan frequency range
3. Bread board
4. IC : 74LS00 MOTOROLA 74LS00 IC
(NAND)
5. IC : 74LS02 MOTOROLA 74LS02 IC
(NOR)
6. Connecting wire FINOLEX N/A N/A

THEORY::

NAND & NOR are called universal logic gates because they can be
used to implement any of the other gates (AND, OR, NOT, XOR, XNOR).

NAND GATE::

It is the complement of the AND of the inputs. It has two or more inputs
and an output. The output will be high if any or all of the inputs are low.
Mathematically it can be defined as Y=(A.B)’ .

NOR GATE::

It is the complement of OR of the inputs. It has two or more inputs and


an output. The output will be low if any or all of the inputs are high.
Mathematically it can be defined as Y= (A+B)’.
Implementation of various logic gates are shown below with
corresponding TRUTH TABLE.

3 NOT GATE:

TRUTH TABLE
A Y=A’
Logic symbol: Y=A’ O 1
1 0

Using NAND gate:

Using NOR gate:

TRUTH TABLE
2) AND GATE:
A B Y=A.B
0 0 0
0 1 0
1 0 0
Logic symbol: 1 1 1
Y=A.B

Using NAND gate:

Using NOR gate:


3) OR GATE::

TRUTH TABLE
A B Y=A+B
Logical symbol: 0 0 0
0 1 1
1 0 1
1 1 1

Y=A+B

Using NAND gate:

Using NOR gate:

4) NAND GATE::
Logical symbol

TRUTH TABLE
A B Y=(A.B)’
0 0 1
0 1 1
1 0 1
1 1 0
Y=(A.B)’
Using NOR gate:

5) NOR GATE::

Logical symbol:

TRUTH TABLE
A B Y=(A+B)’
0 0 1
0 1 0
1 0 0
1 1 0
Y=(A+B)’

Using NAND gate:

6) XOR GATE::
Logic symbol:
TRUTH TABLE
A B Y=A(+)B
0 0 0
0 1 1
1 0 1
1 1 0
Y=A(+)B

Using NAND gate:

Using NOR gate:

7) X-NOR GATE:

Logic symbol:
TRUTH TABLE
Y=A A B Y=A(.)B
(.)B 0 0 1
0 1 0
Using NAND gate: 1 0 0
1 1 1

Using NOR gate:

OBSERVATION TABLE::

In the table given below we shall see that the behavior of the
gates tallies totally with the experimental results.

Inputs NOT AND OR NAND NOR XOR XNOR


A B Y=A’ Y=A.B Y=A+B Y=(A.B)’ Y=(A+B)’ Y=A(+)B Y=A(.)B
L L H L L H H L H
L H L H H L H L
H L L L H H L H L
H H H H L L L H

CONCLUSION:
In the above experiment we saw the theoretical Boolean algebra tallies
totally with the experimental data. It implies that with the universal gates
(NAND & NOR) with can construct any basic logic gates and thus using the
universal gates we eliminate the requirement of all the gates during any
experiment.

You might also like