Digital Electronics - Digital Logic Gates Mte-403

You might also like

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 32

Logic Gates

Learning Objectives

◾ In this chapter you will learn about:

 Logic gates

 Logic circuits and Boolean


expressions
 Combinational circuits and design
Logic Gates

◾ Logic gates are electronic c ircuits that operate on


one or more input signals to produce standard
output signal
◾ Are the building blocks of all the circuits in a
computer
◾ Some of the most basic and useful logic gates are -
◾ AND,
◾ OR,
◾ NOT,
◾ NAND and
◾ NOR gate
3
AND Gate
◾ Physical realization of logical multiplication (AND) operation

◾ Generates an output signal of 1 only if all input signals are


also 1
◾ AND Gate (Block Diagram Symbol and Truth Table)

4
OR
Gate
◾ Physical realization
logical of
operation addition
(OR)
◾ Generates an output
signal of 1 if at least one
of the input signals is
also 1
◾ OR Gate (Block Diagram
Symbol and Truth Table)

5
NOT
Gate
◾ Physic al realization
of complementation
operation
◾ Generates an output
signal, which is the
reverse of the input
signal

6
NAND Gate
◾ Complemented AND gate
◾ Generates an output signal
of:
① 1 if any one of the inputs is
a 0
② 0 when all the inputs are 1

7
NOR Gate
◾ Complemented OR gate
◾ Generates an output signal
of:
① 1 only when all inputs are 0
② 0 if any one of inputs is a 1

8
Special Gate: Ex-OR Gate
The full form of Ex-OR gate is Exclusive-OR gate. Its function is same as
that of OR gate except for some cases, when the inputs having even number
of ones.
The following table shows the truth table of 2-input Ex-OR gate.
Here A, B are the inputs and Y is the output of two input Ex-OR gate. The
truth table of Ex-OR gate is same as that of OR gate for first three rows. The
only modification is in the fourth row. That means, the output (Y) is zero
instead of one, when both the inputs are one, since the inputs having even
number of ones.
Therefore, the output of Ex-OR gate is ‘1’, when only one of the two inputs is
‘1’. And it is zero, when both inputs are same.
Below figure shows the symbol of Ex-OR gate, which is having two inputs
A, B and one output, Y.
A B Y=A⊕B
0 0 0
0 1 1
1 0 1
1 1 0
Odd Function

Ex-OR gate operation is similar to that of OR gate,


except for few combination(s) of inputs. That’s why the
Ex-OR gate symbol is represented like that. The output
of Ex-OR gate is ‘1’, when odd number of ones present
at the inputs. Hence, the output of Ex-OR gate is also
called as an odd function.
Special Gate: Ex-NOR Gate
The full form of Ex-NOR gate is Exclusive-NOR gate. Its function is same as
that of NOR gate except for some cases, when the inputs having even
number of ones.
The following table shows the truth table of 2-input Ex-NOR gate.
Here A, B are the inputs and Y is the output. The truth table of Ex-NOR gate
is same as that of NOR gate for first three rows. The only modification is in
the fourth row. That means, the output is one instead of zero, when both
the inputs are one.
Therefore, the output of Ex-NOR gate is ‘1’, when both inputs are same. And
it is zero, when both the inputs are different.
The following figure shows the symbol of Ex-NOR gate, which is having two
inputs A, B and one output, Y.

A B A⊙B
0 0 1
0 1 0
1 0 0
1 1 1
Even Function
Ex-NOR gate operation is similar to that of NOR gate,
except for few combination(s) of inputs. That’s why the
Ex-NOR gate symbol is represented like that. The
output of Ex-NOR gate is ‘1’, when even number of ones
present at the inputs. Hence, the output of Ex-NOR gate
is also called as an even function.
From the above truth tables of Ex-OR & Ex-NOR logic
gates, we can easily notice that the Ex-NOR operation is
just the logical inversion of Ex-OR operation.
Logic
Circuits
◾ When logic gates are interconnected to form a
gating / logic network, it is known as a
combinational logic circuit
◾ The Boolean algebra expression for a given logic
circuit can be derived by systematically progressing
from input to output on the gates
◾ The three logic gates (AND, OR, and NOT) are
logically complete because any Boolean expression
can be realized as a logic circuit using only these
three gates

13
Finding Boolean Expression of
a Logic Circuit (Example 1)

14
Finding Boolean Expression of
a Logic Circuit (Example 2)

15
Constructing a Logic Circuit from
a Boolean Expression (Example
1)

16
Constructing a Logic Circuit from
a Boolean Expression (Example
2)

17
Universal NAND
Gate
◾NAND gate is an universal gate, it is alone
sufficient to implement any Boolean
expression
◾To understand this, consider:
• Basic logic gates (AND, OR, and NOT) are
logically complete
• Sufficient to show that AND, OR, and NOT
gates
can be implemented with NAND gates

18
Implementation of NOT, AND
and OR Gates by NAND Gates

19
Universal NOR
Gate

◾ NOR gate is an universal gate, it is alone sufficient


to implement any Boolean expression
◾ To understand this, consider:
• Basic logic gates (AND, OR, and NOT) are logically complete
• Sufficient to show that AND, OR, and NOT gates can
be
implemented with NOR gates

20
Implementation of NOT, OR
and AND Gates by NOR
Gates

21
2
2
2
3
24
Positive and Negative Logic
2
5
Demonstratio
n of positive
and negative
logic
26
2
8

by Tajim
Practical 30
Experiment

Logical NAND
& AND gate
experiment
with
7400 & 7408
IC
Diagram Of 31
74HC00
Apparatus 33

1. D.C power supply


5V 2. 7400, 7408 IC
3. Resistances- 220
ohm
4. LED
5. C onnecting wires
6. Bread board
What we
need 3
4

A Bread
Connecting
Board
wire

AND gate
CIRCUIT
DIAGRAM 35

74HC00

You might also like