Introduction to Logic, Logic Gates and

Boolean Algebra
Topics to be covered
• Logic Gates (NOT, AND, OR, NAND, NOR, XOR, XNOR)
• Rules of Boolean Algebra
• DeMorgan’s Theorem

Digital Logic and Circuits (Lecture-1)

 Logic Gates
▪ Logic Gates are the basic building blocks of any digital system. A logic gate can have one or more than one input
but only one output. The relationship between the input/s and the output is based on a certain logic. The
gates are named based on the logic.
▪ The names of the logic gates are:
• Basic Gates:
• NOT Gate or Inverter
• AND Gate
• OR Gate
• Universal Gates:
• NAND Gate
• NOR Gate
• Exclusive Gates:
• Exclusive-OR Gate
• Exclusive-NOR

Digital Logic and Circuits (Lecture-1)

 Bit: in binary system we know that there are two digits 0 (low voltage)
and 1(high voltage). The voltages used to represent a ‘1’ or ‘0’ are called
logic levels

VH (max) 5V
High (Binary 1) Logic-1=4.5V-5V
VH (min) 4.5V
Unacceptable Range
VL (max) 1.5V
Low (Binary 0)
Logic-0=0-1.5V
VL (min) 0V

 Pulse is when clock frequency is applied to a circuit.

 Rising edge and falling edge.
 Periodic and non-periodic waveforms.
 Timing diagram
 Inverter(NOT gate)

 Logic:-Output of an inverter is opposite/complement of its input.
Truth table

Boolean output expression

X=A’
Symbol
0 = LOW
1 = HIGH

voltage
When the input is LOW, the output
is HIGH 0 1
When the input is HIGH, the 1 0
output is LOW time
Pulsed waveforms

5
 AND Gate
Symbol
 Logic:-The output of an AND gate is
HIGH only when all inputs are
HIGH. For all other cases of input,
Truth table output is low.

voltage
0 1 0 1
0 0 1 1
0 0 0 1

0 = LOW
Pulsed time
1 = HIGH
Boolean output waveforms
N =2𝒏 expression
𝑋 = 𝐴 .𝐵

6
 Symbol
The OR Gate
 Logic:-The output of an OR gate is
HIGH whenever one or more inputs
are HIGH. For all other cases of input
states , the output is low.

Truth table

voltage
0 1 0 1
0 0 1 1
0 1 1 1
Boolean output
expression
0 = LOW time
1 = HIGH Pulsed
Logical OR wavefor
operator ms
7
UNIVERSAL GATE
The NAND Gate
Symbol

 Logic:- The output of an NAND gate is LOW only when

all inputs are HIGH. For all other cases of input, output
is high.
Truth-table

Boolean output
expression
0 1
𝑋 = 𝐴 .𝐵 0 1

1 0

0 = LOW
1 = HIGH Pulsed waveforms
8
UNIVERSAL GATE
The NOR Gate
Symbol

 Logic:-The output of an NOR gate is LOW whenever

one or more inputs are HIGH. For all other cases of
input states , the output is HIGH.
Truth table

Boolean output
expression

0 = LOW
1 = HIGH
Pulsed waveforms

9
 Exclusive-OR (XOR)
Symbol

 Logic:- The output for XOR gate is HIGH when odd

number of inputs are HIGH. For all other cases of
input, output is LOW.

Truth table Boolean output

expression
0 1 0 1
0 0 1 1
X=A’.B+A.B’ 0 1 1 0

Pulsed waveforms
0 = LOW
1 = HIGH
The output of an XOR gate is HIGH when there are
ODD number of 1’s on the inputs to the gate
10
 Exclusive-NOR Gate (XNOR)
Symbol


Logic:- The output for XNOR gate is LOW when odd
number of inputs are HIGH. For all other cases of
input, output is HIGH.

Truth table
Boolean output
expression

0 = LOW Pulsed waveforms

1 = HIGH

11


 1
0

0 1
 𝐴 + 𝐵(𝐴 + 𝐴)ҧ
𝐴 + 𝐵. 1 = 𝐴 + 𝐵

𝐴 𝐴 + 𝐵 + 𝐴(𝐴ҧ + 𝐵)
𝐴 + 𝐵 (𝐴ҧ + 𝐵)

= 𝐴 1 + 𝐶 + 𝐵 + 𝐵𝐶
= 𝐴. 1 + 𝐵𝐶
= 𝐴 + 𝐵𝐶
Simplification using boolean algebra
Obama + Obama + Obama = Obama

B(1+C+A+A)+AC
B.1+AC
B+AC
▪ The first theorem is stated as follows:
The complement of a product of variables is equal to the sum of the complements
of the variable.
The formula of this theorem for two variables is written as
𝐗𝐘 = 𝐗 + 𝐘
▪ The second theorem is stated as follows:
The complement of a sum of variables is equal to the product of the complements
of the variables.
The formula of this theorem for two variables is written as
𝐗 + 𝐘 =X . Y
 Textbooks:

 [1] Thomas L. Floyd, “Digital Fundamentals” 11th
edition, Prentice Hall.
 [2] M. Morris Mano, “Digital Logic & Computer
Design” Prentice Hall.