Lab Report

Digital Circuit and Systems

NAME – Ankit joshi

SECTION – B
ROLL NUMBER – 2024BTECH076
AIM:
Design and verify of logic gates (AND, OR, NOT, Ex-OR, Ex-NOR) on Breadboard
using minimum number of NAND Gates [IC ( 7400 ) - NAND gate ] only

Components used:
 Breadboard
 Wires
 Resistor
 LED bulb
 IC 7400
 Battery

THEORY:
We can implement any Boolean function using a universal gate
made of this specific type only. In digital logic, two of the most common universal gates are
NAND and NOR gates. This is beneficial in real world as NOR and NAND gates are less
costly and easier to manufacture than other forms of logic gates. In fact, NOT, AND, and OR
gates are not universally functional. Though all three of them are combined logic gates which
could be used to obtain any possible Boolean switching functions but not by themselves.
Thus, they are not universal gates unlike the NOR and NAND logic gates .

NAND Gate as A Universal Gate: This diagram is for a NAND gate with two inputs.

The first part of this consists of an AND gate, while the second section is a dot that represents a
NOT gate. When the NAND gate operates, it first goes through the AND gate, its output is
reversed and this eventually becomes the final output. Hence, we shall now examine the truth
table for NAND gate.

The truth table for NAND gate is thus:

A B AB
0 0 1
0 1 1
1 0 1
1 1 0
EXPERIMENTAL STEPS:
1). NAND to AND Gate - The below diagram is of an AND gate made from NAND gate.

When
both
switch
es ON

When
one
switchi
s OFF
and
other
is ON
 When
both
switch
es OFF

Here, NAND Gate has been converted to AND Gate. The 4 cases given above shows
all the 4 cases different cases of AND Gate Truth

AND GATE Truth table

A B A AND B

0 0 0

0 1 0

1 0 0

1 1 1
2) NAND to OR Gate - The below diagram is of an OR gate made from NAND gate.

When
both
switch
es OFF

When
one
switchi
s OFF
and
other
is ON
 When
both
switch
es ON

Here, NAND Gate has been converted to OR Gate. The 4 cases given above shows all
the 4 cases different cases of OR Gate Truth Table.

1. OR GATE TRUTH TABLE

A B A OR B
0 0 0
0 1 1
1 0 1
1 1 1
3) NAND to NOT Gate-The below diagram is of an NOT gate made from NAN

When
switchi
s OFF

When
switchi
s ON
Here, NAND Gate has been converted to NOT Gate. The 2 cases given above shows all the 2
cases different cases of NOT Gate Truth Table.

3) NOT Gate Truth Table

A ~A
0 1
1 0

4) NAND to XOR Gate-The below diagram is of an XOR gate made from NAND gate.

When
one
switchi
s OFF
and
other
is ON
 When
both
switch
es OFF

Here, NAND Gate has been converted to XOR Gate. The 4 cases given above shows
all the 4 cases different cases of XOR Gate Truth Table.
4)XOR Gate Truth Table
A B A XOR B
0 0 0
0 1 1
1 0 1
1 1 0

5) NAND to XNOR Gate-The below diagram is of an XNOR gate made from

NAND gate.
Here, NAND Gate has been converted to XNOR Gate. The 4 cases given above shows all
the 4 cases different cases of XNOR Gate Truth Table

5) XNOR Gate Truth Table.

A B A XNOR B
0 0 1
0 1 0
1 0 0
1 1 1

When
both
switch
es OFF

When
one
switchi
s OFF
and
other
is ON
Using NAND Gate:
 NOT Gate-
The symbol for this is:
(F= A’)

Tying the inputs of a NAND gate together makes a NOT gate

Let Y = (AB)’ where Y is the output and the inputs A and B tying the inputs together means A
=B.
Y = (AA)’ = (A)’, this is Boolean logic for a NOT gate.
  AND Gate-
(F =AB)

The symbol for this is:

The AND gate is made by adding an inverter (or a NAND gate configured as an inverter) to the
output of the NAND gate

Y = ((AB)’)’ = AB

 OR Gate-
(F = A+B)
The OR gate is made by adding inverters ( or NAND gates configured as inverters) to each of the
NAND gate inputs. It will take 3 two inputs NANDs to make 1 two input OR
First use De Morgan’s theorem Y =
(AB)’ = A’ + B’
now invert the inputs

Y = (A’)’ + (B’)’ = A + B

 XOR Gate-
(F= X ْ Y)
The exclusive OR gate
Y = A’B + AB’ requires four two input NAND gates
NAND gate 1 has inputs A and B its output is (AB)’ = A’ +B’. This output goes to NAND
gates 2 and 3
NAND gate 2 has inputs A and (A’ +B’), its output (AB’)’ goes to NAND gate 4.
NAND gate 3 has inputs B and (A’ +B’), its output (BA’)’ goes to NAND gate 4.
NAND gate 4 acts as an OR gate with inverted inputs (De Morgan’s theorem) The
inputs to NAND gate 4 are the outputs from NAND gates 2 and 3
Y = ((A’B)’)’ + ((AB’)’)’= A’B + AB’
  XNOR Gate-
(X Θ Y = X Y + X' Y' = (X ْ Y)')

The exclusive NOR can be made from the exclusive OR above by adding an inverter ( NAND
gate configured as an Inverter) to the exclusive OR output. The exclusive NOR will require 5
two Input NAND gates

Y = (A’B +AB’)’= (A’B)’(AB’)’ = (A +B’)(A’ + B) = AB + A’B’

APPLICATION OF NAND LOGIC GATE (UNIVERSAL GATE):
2) Compactness and Efficiency:
One big reason why NAND gates are preferred in integrated circuit designs is that they
can be more compressed and require fewer transistors than other circuits built using
other gates. This may result in a better utilization of space on the chip.

3) Ease of Design:
One advantage of designing digital circuits only with NAND gates is simplicity and
overall design process. You can create AND, OR, NOT and others with NAND gates,
which means you will have a more methodical and consistent way of designing.

4) Reduced Power Consumption:

In some circuits NAND gates help to cut back power consumption. In battery operated
devices such as those that focus on energy efficiency this becomes very necessary.

5) Memory and Flip-Flops:

Digital memory and storage devices have memory cells made up of flip-flops using NAND
gates as the building