Unit-2

Logic Gates & Logic Family

Presented By: Ms.C.M.Maind

Lecturer in E & TC Department
AISSMS’S POLYTECHNIC PUNE

1
Digital Techniques(DTE-22320) Ms.C.M.Maind
Logic Gates :
• Logic gates are electronic circuits. For implementing
various logic expressions ( Boolean expressions), logic
gates can be used.
• The logic gate is the most basic building block of
combinational logic.
• Logic gate performs a logical operation on one or
more logical inputs and produce a single logical
output.
• Truth table for a logic system lists all possible
combinations of input variables and corresponding
output generated by the logic system.

Digital Techniques(DTE-22320)
Ms.C.M.Maind

2
• In general, if a logic circuit has n binary
inputs, its truth table will have 2n possible
input combinations (i.e. truth table contains
2n rows).
• Figure 1. shows a sample 2–input logic
system and table 1. shows a sample truth
table for a 2–input logic system.

Figure 1

Digital Techniques(DTE-22320)
Ms.C.M.Maind 3
Digital Techniques(DTE-22320)
Ms.C.M.Maind 4
Basic Gates
• Logic gate is the most basic building block
of any digital system (even for computers).
• Each basic logic gate is a piece of hardware
or an electronic circuit that can be used to
implement some basic logic expression.
• For implementing various laws of Boolean
algebra, basic gates can be used.
• Basic gates perform basic logical operations
on the logical inputs.
• There are three basic logic gates, namely the
OR gate , the AND gate and the NOT gate.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 5
• The OR gate performs logical OR operation
on two or more inputs.
• The OR gate has two or more inputs and
a single output.
• Output of an OR gate is LOW if all the inputs
are LOW. In all other cases, output of OR gate
is HIGH.
• The OR operation on two independent logical
variables A and B can be represented by
following logic expression
• 𝑌=𝐴+𝐵

Digital Techniques(DTE-22320)
Ms.C.M.Maind 6
Digital Techniques(DTE-22320)
Ms.C.M.Maind 7
 2. AND gate
 The AND gate performs logical AND operation
on two or more inputs.
 The AND gate has two or more inputs
and a single output.
 Output of an AND gate is HIGH if all the
inputs are HIGH. In all other cases, output of
AND gate is LOW.
 The AND operation on two independent
logical variables A and B can be
represented by following logic expression.
 𝑌 = 𝐴. 𝐵 It is read as Y is equal to A AND B.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 8
Digital Techniques(DTE-22320)
Ms.C.M.Maind 9
 NOT gate
• The NOT gate performs logical NOT(i.e.
negation) operation on an input.
• The NOT gate has a single input and a
single output.
• Output of an NOT gate is complement of its
input.
• If input is LOW, output is HIGH and if input is
HIGH, output is LOW.
• The NOT operation on a logical variable X can
be represented by following logic expression
• 𝑌= ̅
or
𝑌 = 𝑋′ It is read as Y is equal to NOT X.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 10
IC pin configuration of 7404

Digital Techniques(DTE-22320)
Ms.C.M.Maind 11
 In addition to basic gates, other logic gates like
NAND and NOR gates are also used in designing
digital circuits.

 The NAND gate and NOR gate are called

universal gates because using any one type of
those gates any logic expression can be realized.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 12
 Implementation of any logic expression is
economical if it is done using any one type of
universal gates (as compared to
implementation using basic gates).

 The basic reason behind this is the easier

fabrication of these gates

Digital Techniques(DTE-22320)
Ms.C.M.Maind 13
 NAND stands for NOT AND.
 The name suggests that it is a combination
of AND gate followed by a NOT gate as shown
in figure.

Fig.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 14
•The NAND gate has two or more inputs and a single
output. Output of an
NAND gate is LOW if all the inputs are HIGH. In all
other cases, output of
NAND gate is HIGH.

• The NAND operation on two independent logical

variables A and B can be
represented by following logic expression (sometimes
also called logical
equation).

Digital Techniques(DTE-22320)
Ms.C.M.Maind 15
Truth table for 2 – input NAND gate

Digital Techniques(DTE-22320)
Ms.C.M.Maind 16

NOR stands for NOT OR. The name suggests
that it is a combination of OR gate followed
by a NOT gate as shown in figure

Digital Techniques(DTE-22320)
Ms.C.M.Maind 17
• The NOR gate has two or more inputs and a single
output. Output of an NOR gate is HIGH if all the inputs
are LOW. In all other cases, output of NOR gate is
LOW.

•The NOR operation on two independent logical

variables A and B can be represented by following
logic expression (sometimes also called logical
equation)

Digital Techniques(DTE-22320)
Ms.C.M.Maind 18
Digital Techniques(DTE-22320)
Ms.C.M.Maind 19
 The gates those are derived from basic gates
are called as derived gates.

 Two more derived gates are Ex-OR gate and

Ex-NOR gate.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 20
 The Ex-OR stands for Exclusive OR. It is used
for performing OR operation exclusively.
 Ex-OR gate has two inputs and a single
output.
 Ex-OR gate is HIGH if odd number of inputs
is HIGH. If even number of inputs is HIGH,
output is LOW.
 The logic expression Ex-OR gate is shown
below

Digital Techniques(DTE-22320)
Ms.C.M.Maind 21
Digital Techniques(DTE-22320)
Ms.C.M.Maind 22
 The Ex-NOR stands for Exclusive NOR.
 It means NOT of Ex-OR.
 Ex-NOR gate has two inputs and a single
output.
 Output of Ex-NOR gate is HIGH if even
number of inputs is HIGH.
 If odd number of inputs is LOW,
output is LOW.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 23
 The logic expression (sometimes also called
logical equation) of 2 – input Ex-NOR gate is
shown below.
 𝑌 =( ̅ ̅⊕̅̅̅̅ ̅) = 𝐴𝐵 + ̅𝐵  It is read as Y is equal
to A Ex-NOR B.
 Logical symbol for 2 – input Ex-NOR gate is
shown in figure

Digital Techniques(DTE-22320)
Ms.C.M.Maind 24
Digital Techniques(DTE-22320)
Ms.C.M.Maind 25
Logic Gates

NOT

Classification of Number System

Digital Techniques(DTE-22320)
Ms.C.M.Maind 26
Deriving gates from universal gates

 The NAND gate and NOR gate are called

universal gates because using any one type
of those gates any logic expression can be
realized.

 We can also derive all the gates using any

one type of universal gates.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 27
Deriving NOT gate

Digital Techniques(DTE-22320)
Ms.C.M.Maind 28
Digital Techniques(DTE-22320)
Ms.C.M.Maind 29
Digital Techniques(DTE-22320)
Ms.C.M.Maind 30
 Boolean algebra is mathematics of logic.
 It is one of the most basic tool for
simplifying Boolean laws.
 Logic variables are denoted by capital letters
(e.g. A,B, C, …). If value of 𝐴 = 0, then ̅ = 1
and if value of 𝐴 = 1, then ̅ = 0.
 Two Boolean expressions are said to be equal
if and only if the truth tables of them are
identical.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 31
 Fundamental laws of Boolean algebra are
shown below.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 32
Digital Techniques(DTE-22320)
Ms.C.M.Maind 33
Digital Techniques(DTE-22320)
Ms.C.M.Maind 34
Digital Techniques(DTE-22320)
Ms.C.M.Maind 35
 1
1
2

Digital Techniques(DTE-22320)
Ms.C.M.Maind 36
Digital Techniques(DTE-22320)
Ms.C.M.Maind 37
Digital Techniques(DTE-22320)
Ms.C.M.Maind 38
Digital Techniques(DTE-22320)
Ms.C.M.Maind 39
Simplify the following boolean expression using laws and realize it using
basic gates only.

Digital Techniques(DTE-22320)
Ms.C.M.Maind 40
2

Digital Techniques(DTE-22320)
Ms.C.M.Maind 41
3

Digital Techniques(DTE-22320)
Ms.C.M.Maind 42
Digital Techniques(DTE-22320)
Ms.C.M.Maind 43
Digital Techniques(DTE-22320)
Ms.C.M.Maind 44
Digital Techniques(DTE-22320)
Ms.C.M.Maind 45
Digital Techniques(DTE-22320)
Ms.C.M.Maind 46
 Y=AB+AB+AB

Digital Techniques(DTE-22320)
Ms.C.M.Maind 47