Logic Circuits with Universal Gates

Experiment - II

Name : K.A.G.R.K. Weerasinghe

Reg. No : 16sea029
Abstract
Basically there are six types of logic gates with its unique functions and it is able to define
any kind of logical operation in digital electronics. Among aforementioned six gates, NAND
and NOR gates are considered as universal gate because both of them have ability to
implement any Boolean function without using any other gate type. Accordingly universal
gates have become as very important concept in digital electronic.

Page | i
Table of Contents

1. Introduction .................................................................................................................... 1

1.1 Universal gates ........................................................................................................ 1

1.2 Karnaugh Mapping ................................................................................................. 2

1.3 Laws associated with simplifying Boolean algebra ................................................ 3

2. Pre-Lab Questions .......................................................................................................... 4

3. Methodology .................................................................................................................. 7

3.1.1 Methodology.................................................................................................... 7

3.1.2 Equipment and Materials ................................................................................. 7

4. Results ........................................................................................................................... 8

5. Analysis & Discussions ................................................................................................. 9

6. Conclusions ................................................................................................................... 9

7. References ................................................................................................................... 10

List of Tables

Table 4.1: Test result for Experiment - 1............................................................................... 8

Table 4.2: Test result for Experiment - 2............................................................................... 8

List of Figures

Figure 1.1: NAND gate equivalents ...................................................................................... 1

Figure 1.2: NOR gate equivalents ......................................................................................... 2
Figure 1.3: Laws associated with simplifying Boolean algebra ............................................ 3

Page | ii
1. Introduction
1.1 Universal gates
NAND and NOR gates are considered as universal gates because of its particular
characteristic which any of them can create any logical Boolean expressions. Following
examples further clarifies it.

NAND gate equivalent for other logic gates

Figure 1.1: NAND gate equivalents

(Source: http://electrotrical.blogspot.com/2012/01/using-universal-gates-to-form-logic.html)

Page | 1
NOR gate equivalent for other logic gates

Figure 1.2: NOR gate equivalents

(Source: http://electrotrical.blogspot.com/2012/01/using-universal-gates-to-form-logic.html)

1.2 Karnaugh Mapping

Karnaugh Mapping (K-map) is a method used for simplifying Boolean algebra.

Page | 2
1.3 Laws associated with simplifying Boolean algebra
Following are the rules which can be followed to simplify Boolean algebra. Among the rules
indicated below, De Morgan’s law is very important because it expresses theory which
cannot be noted simply and therefore it can be used to simplify complex Boolean expression
quickly.

Figure 1.3: Laws associated with simplifying Boolean algebra

Page | 3
2. Pre-Lab Questions
A. Show how an NOT gate can be implemented using a NOR gate.

A Ā

B. Show how an AND gate can be implemented using only NAND gates. Do same using
NOR gates.

AND using NANDs

A
A.B
B
AND using NORs

A.B

C. Show how a ExOR gate can be implemented using only NAND gates. Do same using
NOR gates.
EXOR using NANDs

A A B

Page | 4
 EXOR using NORs

A
A B

D. Consider the expression F = AB+CD' construct a truth table for F. If the circuit
needs to be implemented using only NAND gates how would you do it?

A B C D F A B C D F
0 0 0 1 0 1 0 0 1 0
0 0 0 0 0 1 0 0 0 0
0 0 1 1 0 1 0 1 1 0
0 0 1 0 1 1 0 1 0 1
0 1 0 1 0 1 1 0 1 1
0 1 0 0 0 1 1 0 0 1
0 1 1 1 0 1 1 1 1 1
0 1 1 0 1 1 1 1 0 1

Here;
AB+CD`= (A`B`C`D)`= ABCD`

B F = AB+CD`

Page | 5
E. Consider the following truth table. Derive a simplified Boolean expression for the
function F. If you were to implement the circuit using only NOR gates, how would
you do it?

A B C D F A B C D F
0 0 0 0 0 1 0 0 0 1
0 0 0 1 0 1 0 0 1 0
0 0 1 0 0 1 0 1 0 1
0 0 1 1 0 1 0 1 1 1
0 1 0 0 1 1 1 0 0 1
0 1 0 1 0 1 1 0 1 0
0 1 1 0 1 1 1 1 0 1
0 1 1 1 1 1 1 1 1 1

Karnaugh Map for Question (E)

AB

00 01 11 10
00 0 1 1 1
01 0 0 0 0
CD
11 0 1 1 1
10 0 1 1 1

A
F = (A+B) (C+D`)
B

Page | 6
3. Methodology
3.1.1 Methodology
 Experiment : 1
First construct the circuit which was obtained as the answer for Question (D) in pre
lab exercises (Here SN 7400 IC was used for NAND gates and LED is used to check
the output of circuit). After supplying power to the circuit correctly, verify the result
with truth table.
 Experiment : 2
Secondly construct the circuit which was obtained as the answer for Question (E) in
pre lab exercises (Here SN 7402 IC was used for NOR gates and LED is used to
check the output of circuit). After supplying power to the circuit correctly, verify the
result with truth table.

3.1.2 Equipment and Materials

 Bread board and connecting cables
 SN 7400 and SN 7402 ICs
 LED bulbs
 1KΩ and 330Ω resistors
 Dip Switch
 Voltage regulator
 Multi meter

Page | 7
4. Results
Observed results are tabulated below respectively Table 4.1 for Experiment – 1 with NAND
gates and Table 4.2 for Experiment – 2 with NOR gate.

Table 4.1: Test result for Experiment - 1

A B C D F Status of LED

0 0 0 1 0 OFF
0 0 0 0 0 OFF
0 0 1 1 0 OFF
0 0 1 0 1 ON
0 1 0 1 0 OFF
0 1 0 0 0 OFF
0 1 1 1 0 OFF
0 1 1 0 1 ON
1 0 0 1 0 OFF
1 0 0 0 0 OFF
1 0 1 1 0 OFF
1 0 1 0 1 ON
1 1 0 1 1 ON
1 1 0 0 1 ON
1 1 1 1 1 ON
1 1 1 0 1 ON

Table 4.2: Test result for Experiment - 2

A B C D F Status of LED
0 0 0 0 0 OFF
0 0 0 1 0 OFF
0 0 1 0 0 OFF
0 0 1 1 0 OFF
0 1 0 0 1 ON
0 1 0 1 0 OFF
0 1 1 0 1 ON

Page | 8
 0 1 1 1 1 ON
1 0 0 0 1 ON
1 0 0 1 0 OFF
1 0 1 0 1 ON
1 0 1 1 1 ON
1 1 0 0 1 ON
1 1 0 1 0 OFF
1 1 1 0 1 ON
1 1 1 1 1 ON

5. Analysis & Discussions

As shown in the above tables, output derived based on the theories are matching with the
output indicate from status of LED bulb. Accordingly it was assured that circuits were
correctly configured and also verify the accurateness of circuits created using the universal
gates.

6. Conclusions
This experiment allows student to understand the concept of universal gates and their
applications. Furthermore it was able to study about Karnaugh mapping, i.e. a quick and easy
method for simplifying truth table result. Addition to above laws associated with simplifying
Boolean expressions was also studied.

Page | 9
7. References
AspenCore Inc. (2016). Logic Gates. Retrieved August 03, 2016, from Electronics Tutorials:
http://www.electronics-tutorials.ws/

EETech Media. (n.d.). All About Circuits. Retrieved August 03, 2016, from
http://www.allaboutcircuits.com/

Electrical4u. (2016). Universal Gate | NAND and NOR Gate as Universal Gate. Retrieved
August 2, 2016, from Electrical4u: http://www.electrical4u.com/universal-gate-
nand-nor-gate-as-universal-gate/

Hughes, E. (2008). Electrical and Electronic Technology (10th ed.). (J. Hiley, K. Brown, &
M. Smith, Eds.) Essex: Pearson Education Limited.

Page | 10