0% found this document useful (0 votes)
4 views

Digital Logic Chapter 2 Logic gates

Chapter 2 discusses logic gates, which are fundamental components of digital systems, categorized into basic (NOT, OR, AND) and derived gates (NAND, NOR, XOR, XNOR). It explains the functionality and truth tables of each gate, including universal gates that can create any Boolean function. The chapter also covers positive and negative logic systems, providing truth tables for various gates in both systems and introduces De-Morgan's Theorem for Boolean algebra verification.

Uploaded by

ak1990074
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
0% found this document useful (0 votes)
4 views

Digital Logic Chapter 2 Logic gates

Chapter 2 discusses logic gates, which are fundamental components of digital systems, categorized into basic (NOT, OR, AND) and derived gates (NAND, NOR, XOR, XNOR). It explains the functionality and truth tables of each gate, including universal gates that can create any Boolean function. The chapter also covers positive and negative logic systems, providing truth tables for various gates in both systems and introduces De-Morgan's Theorem for Boolean algebra verification.

Uploaded by

ak1990074
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/ 12

Chapter 2

Logic gates

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


Logic Gate
Logic gates are the basic building blocks of any digital system. It is an electronic circuit having one or
more than one input and only one output. Logic gates are categorized in two type i.e. Basic logic gates
and Derived logic gates.

Basic logic gates


There are main three basic logic gates and these are NOT gate, OR gate, AND gate. All the derived logic
gate and universal gates are constructed by using the basic logic gates.

NOT Gate
The NOT gate is a digital logic gate with one input and one output that operates an inverter operation of
the input. The output of the NOT gate is the reverse of the input. It is also called the inverter.
When the input of the NOT gate is 1 (high) then the output will be 0 (low) and vice versa.

The symbol, Boolean expression and truth table of a NOT gate is shown below.

Figure- Symbol and Truth table of NOT gate

OR Gate
The OR gate is a digital logic gate with ‘n’ inputs and one output, that performs logical conjunction
based on the combinations of its inputs.
The output of the OR gate is 1 (high) only when one or more inputs are 1 (high).
If all the inputs of the gate are 0 (low), then only the output of the OR gate is 0 (low).
The symbol, Boolean expression and truth table of an OR gate with two inputs is shown below.

Figure- Symbol and Truth table of OR gate

AND Gate
The AND gate is a digital logic gate with ‘n’ inputs one output, which performs logical conjunction
based on the combinations of its inputs.
The output of this gate is 1 (high) only when all the inputs are 1 (high).
When one or more inputs of the AND gate are 0 (low), then only the output of the AND gate is 0
(low).

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


The symbol, Boolean expression and truth table of an AND gate with two inputs is shown below.

Figure- Symbol and Truth table of AND gate

Universal Gates
A universal gate is a logic gate which can implement any Boolean function without the need to use any
other type of logic gate. The NAND and NOR gates are called universal gates because any digital
circuit can be implemented by using any one of these two i.e. any logic gate can be created using
NAND or NOR gates only.

Example- AND gate can be made from NAND gate by connecting two NAND gates where the output of
first NAND gate is given to second NAND gate.
-NOT gate from NAND gate, when both the input of NAND gate is same then it work as a NOT gate.

NAND gate
The NAND gate is a digital logic gate with ‘n’ inputs and one output, that performs the operation of the
AND gate followed by the operation of the NOT gate. NAND gate is designed by combining the AND
and NOT gates.
If all inputs of the NAND gate are 1 (high), then the output of the gate is 0 (low).
If one or more inputs are 0 (low), then the output is 1 (high).

The symbol, Boolean expression and truth table of the NAND gate with two inputs is shown below.

Figure- Symbol and Truth table of NAND gate

NOR Gate
The NOR gate is a digital logic gate with n inputs and one output, that performs the operation of the OR
gate followed by the NOT gate. NOR gate is designed by combining the OR and NOT gate.
When any one of the input of the NOR gate is 1 (high), then the output of the NOR gate is 0
(low).
When all inputs are 0 (low), then the output of the NOR gate is 1 (high).

The symbol and truth table of the NOR gate with the truth table is shown below.

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


Figure- Symbol and Truth table of NOR gate

Exclusive-OR Gate (XOR Gate)


The Exclusive-OR gate is a digital logic gate with two inputs and one output. The short form of this gate
is XOR. It performs based on the operation of the OR gate.
If any one of the inputs of this gate is either 1 (high) or 0 (low), then the output of the XOR gate
is 1 (high). OR, Number of 1’s at input is odd then the output is 1 (high).
If both inputs are same i.e. 1 or 0 (high or low), then the output of the XOR gate is 0 (low).
OR, Number of 1’s at input is even then the output is 0 (Low).
The Boolean expression of the XOR gate is:
⊕ . ̅.

The symbol, Boolean expression and truth table of the EX-OR are shown below.

Figure- Symbol and Truth table of XOR gate

Exclusive-NOR Gate (XNOR Gate)


The Exclusive-NOR gate is a digital logic gate with two inputs and one output. The short form of this
gate is XNOR. It performs based on the operation of the NOR gate.
If any one of the inputs of this gate is either 1 (high) or 0 (low), then the output of the XNOR
gate is 0 (low). OR, Number of 1’s at input is odd then the output is 0 (Low).
If both inputs are same i.e. either 1 (high) or 0 (low), then the output of the XNOR gate is 1
(high). OR, Number of 1’s at input is even then the output is 1 (high).
The Boolean expression of the XNOR gate

The symbol, Boolean expression and truth table of the EX-NOR are shown below.

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


Figure- Symbol and Truth table of XNOR gate

Realization of logic gates by using universal logic gates


The universal gates are able to create any other gates as we know that NAND and NOR gate are the
universal gates so we construct all the gates from NAND and NOR respectively.

1. Different gates From NAND gate


a. NOT gate from NAND gate

b. AND gate from NAND gate


. .

c. OR gate from NAND gate


.

d. NOR gate from NAND gate


.
Digital Logic: Chapter 2: Logic gates By Er. MB Sah
e. XOR gate from NAND gate
. . . . .
. . . .
. . . .
. .
. . . .
. .

f. XNOR gate from NAND gate


XNOR gate is the complment of XOR gate. XNOR gate obtained by XOR gate which is
followed by NOT gate.

2. Different gates From NOR gate


a. NOT gate from NOR gate

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


b. AND gate from NOR gate
. .

c. OR gate from NOR gate

d. NAND gate from NOR gate


.

e. XOR gate from NOR gate


Suppose,
First we calculate S

. .
. .
. . . .
. .

Digital Logic: Chapter 2: Logic gates By Er. MB Sah
⊕ ⊕

f. XNOR gate from NOR gate

. .
. .
. . . .
. .

Positive and Negative logic


a. Positive logic
‘1’ is represented by the higher voltage (+5v) or +12v), which we will refer to as a HIGH, and a
‘0’ is represented by the lower voltage level (0v), which we will refer to as a LOW. This is called
positive logic and will be used.
HIGH = 1 and LOW = 0
b. Negative logic
Another system in which a ‘1’ is represented by a LOW and a ‘0’ is represented by a HIGH is
called negative logic.
HIGH = 0 and LOW = 1

Q.1. Consider a gate which outputs high voltage only when all inputs are high and outputs low
voltage otherwise. How this gate does behaves in positive and negative logic system.
Let us consider A and B as an input and Y as an output. ‘H’ be a high and ‘L’ be a low. According to the
question we can draw a truth table
A B Y
L L L
L H L
H L L
H H H
Digital Logic: Chapter 2: Logic gates By Er. MB Sah
According to question, we have to draw truth table in both Positive and Negative logic system
Positive Logic System Negative Logic System
A B Y A B Y
0 0 0 1 1 1
0 1 0 1 0 1
1 0 0 0 1 1
1 1 1 0 0 0

This is the truth table of Positive logic AND gate. This is the truth table of Negative logic AND gate.

Q.2. Consider a gate which outputs high voltage when any of the inputs are high and outputs low
voltage otherwise. How this gate does behaves in positive and negative logic system.
Let us consider A and B as an input and Y as an output. ‘H’ be a high and ‘L’ be a low. According to the
question we can draw a truth table
A B Y
L L L
L H H
H L H
H H H

According to question, we have to draw truth table in both Positive and Negative logic system
Positive Logic System Negative Logic System
A B Y A B Y
0 0 0 1 1 1
0 1 1 1 0 0
1 0 1 0 1 0
1 1 1 0 0 0
This is the truth table of Positive logic OR gate. This is the truth table of Negative logic OR gate.

From the above two questions, we can conclude that two things
a. Positive Logic AND gate is equivalent to Negative logic OR gate.
b. Positive Logic OR gate is equivalent to Negative logic AND gate.

a. Positive Logic AND gate is equivalent to Negative logic OR gate.


Positive Logic AND gate Negative Logic OR gate
A B Y A B Y
0 0 0 1 1 1
0 1 0 1 0 0
1 0 0 0 1 0
1 1 1 0 0 0
b. Positive Logic OR gate is equivalent to Negative logic AND gate.
Positive Logic OR gate Negative Logic AND gate
A B Y A B Y
0 0 0 1 1 1
0 1 1 1 0 1
1 0 1 0 1 1
1 1 1 0 0 0

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


Q.3. Draw the truth table of NAND gate in positive and negative logic
Positive Logic NAND gate Negative Logic NAND gate
A B Y A B Y
0 0 1 1 1 0
0 1 1 1 0 0
1 0 1 0 1 0
1 1 0 0 0 1
Q.4. Draw the truth table of NOR gate in positive and negative logic
Positive Logic NOR gate Negative Logic NOR gate
A B Y A B Y
0 0 1 1 1 0
0 1 0 1 0 1
1 0 0 0 1 1
1 1 0 0 0 1
From the above questions 3 and 4, we can conclude that two things
a. Positive Logic NAND gate is equivalent to Negative logic NOR gate.
b. Positive Logic NOR gate is equivalent to Negative logic NAND gate.

a. Positive Logic NAND gate is equivalent to Negative logic NOR gate.


Positive Logic NAND gate Negative Logic NOR gate
A B Y A B Y
0 0 1 1 1 0
0 1 1 1 0 1
1 0 1 0 1 1
1 1 0 0 0 1
b. Positive Logic NOR gate is equivalent to Negative logic NAND gate.
Positive Logic NOR gate Negative Logic NAND gate
A B Y A B Y
0 0 1 1 1 0
0 1 0 1 0 0
1 0 0 0 1 0
1 1 0 0 0 1
Q.5. Draw the truth table of XOR gate in positive and negative logic
Positive Logic XOR gate Negative Logic XOR gate
A B Y A B Y
0 0 0 1 1 1
0 1 1 1 0 0
1 0 1 0 1 0
1 1 0 0 0 1
Q.6. Draw the truth table of XNOR gate in positive and negative logic
Positive Logic XNOR gate Negative Logic XNOR gate
A B Y A B Y
0 0 1 1 1 0
0 1 0 1 0 1
1 0 0 0 1 1
1 1 1 0 0 0
Digital Logic: Chapter 2: Logic gates By Er. MB Sah
From the above questions 5 and 6, we can conclude that two things
a. Positive Logic XOR gate is equivalent to Negative logic XNOR gate.
b. Positive Logic XNOR gate is equivalent to Negative logic XOR gate.

a. Positive Logic XOR gate is equivalent to Negative logic XNOR gate.


Positive Logic XOR gate Negative Logic XNOR gate
A B Y A B Y
0 0 0 1 1 0
0 1 1 1 0 1
1 0 1 0 1 1
1 1 0 0 0 0
b. Positive Logic XNOR gate is equivalent to Negative logic XOR gate.
Positive Logic XNOR gate Negative Logic XOR gate
A B Y A B Y
0 0 1 1 1 1
0 1 0 1 0 0
1 0 0 0 1 0
1 1 1 0 0 1
De-Morgan's Theorem
A famous mathematician De-Morgan invented the two most important theorems of Boolean algebra.
The De-Morgan's theorems are used for mathematical verification of the equivalency of the NOR and
negative-AND gates and the negative-OR and NAND gates.

First Theorem
The complement result of the AND operation is equal to the OR operation of the complement of that
variables.
.
NAND = Bubbled OR

Figure- Diagram and Truth table for verification of the De Morgan's first theorem

Second Theorem
The complement result of the OR operation is equal to the AND operation of the complement of that
variable.
.
NOR = Bubbled AND

Digital Logic: Chapter 2: Logic gates By Er. MB Sah


Figure- Diagram and Truth table for verification of the De Morgan's first theorem

What is the importance of De Morgan's theorem?


The Demorgan's Theorems have great importance in digital Electronics because it gives an equivalency
between the logic gates.
There are two Demorgan's Theorems one gives equivalent of NOR Gate and other one gives equivalent
of NAND gate.

Applications of logic gates


Logic gates are fundamental building blocks in digital electronics, and they are used in a wide variety of
applications. Here are some key applications of logic gates:
• Manufacturing more complex devices e.g. binary counters etc.
• Decision–making device regarding automatic control of machines and different industrial
processes
• Calculator and computers (processor, memory)
• Digital measuring techniques
• Digital circuits like flip flop, multiplexer and demultiplexer, encoder, decoder etc.
• Digital camera
• Smart phones
• Security system such as alarm system and access control
• Digital processing of communications such as modulation, demodulation etc.
• Musical instruments, games and different domestic appliances
• Medical equipment

Digital Logic: Chapter 2: Logic gates By Er. MB Sah

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy