1

Introduction to Digital Electronics

Boolean Algebra
 2

Introduction to Digital Electronics

Boolean Algebra

Any system or device having two physically

distinct states can be described by Boolean
variables, such as

▪ 0/1
▪ True/False
▪ On /Off (Current/Logic Gates/Devices such as motors)
▪ High/Low (Voltage)
▪ Magnetized /Demagnetized (Hard Disk Platter)
▪ Light passes/Light does not pass (Punch Card Holes)
▪ Light reflects/Light does not reflect (DVD/Optical fiber)
 3

Introduction to Digital Electronics

Boolean Algebra

General systems are either ‘static’ or ‘dynamic’

Examples are typical pressure, temperature measuring systems. They

always measure the current state of pressure/temperature and do not
depend on its past/future states.

For example, measuring instantaneous acceleration of a car. Any

given time, the instantaneous acceleration of a car depends on its
current speed and already accumulated acceleration from past (from
rest).
 4

Introduction to Digital Electronics

Boolean Algebra
Boolean algebra can be used to describe ‘static’ systems.
❑ Binary representation of Boolean systems uses 1’s
and 0’s
❑ A Binary variable or an expression can have a value of
either ‘1’ or ‘0’.
 5

Introduction to Digital Electronics

Boolean Algebra

Systems described by Boolean algebra are digital

systems in contrast to analog systems
Boolean Algebra Operators and Boolean Gates 6
Gates Circuit Algebraic Operator Truth
Symbol Symbol Table

NOT 𝐹 = 𝐴ҧ or 𝐴′ or ! 𝐴 or ~𝐴

AND 𝐹 = 𝐴. 𝐵 or 𝐴𝐵 or 𝐴 ∗ 𝐵

OR 𝐹 =𝐴+𝐵

NAND 𝑭 = (𝑨. 𝑩)

NOR 𝑭= 𝑨+𝑩

XOR 𝐹=

XNOR
6
 7

Introduction to Digital Electronics

Boolean Algebra

▪ All the gates can be created with a series of NAND gates, or a series of
NOR gates.
▪ In a NAND gate,
(i) if the two inputs are shorted (joined together), one can have a
NOT (inverter) gate;
(ii) Adding an inverter to the output, one has an AND gate;
(iii) Inverting the inputs makes an OR gate.
▪ Theoretically, one could design an entire computer out of nothing but
NAND gates.
▪ NAND gate and NOR gate are called universal gates.
▪ NAND gates are used as a string of bits in flash storage (USB pen
drive)- NAND Flash has high density data storage capabilities. 7
 8

Introduction to Digital Electronics

Boolean Algebra
NOT gate

AND gate

OR gate
 9

Introduction to Digital Electronics

Boolean Algebra

Hierarchy of Boolean Operations

▪ Equations are written in the ‘normal’ way
▪ Hierarchy and parentheses usage are same as ‘ordinary’ algebra
▪ For gates, first NOT, then AND and lastly OR are in hierarchy.
▪ One special characteristic of Boolean expressions are its “duality
of operators”, i.e., when in an expression
• all the AND is substituted by OR
• all the OR is substituted by AND
• All 1’s substituted by 0’s
• All 0’s substituted by 1’s
(note that these operations must be done simultaneously in the
whole expression), the value of the expression remains
unchanged.
 10

Introduction to Digital Electronics

Boolean Algebra

*
*
*
*

*
*
 11

Introduction to Digital Electronics

Boolean Algebra

11
 12

Introduction to Digital Electronics

Boolean Algebra
Example Problems of Boolean Algebra
Example-1
Example-2
𝐹 = 𝐴𝐵 + 𝐴𝐵′
′ 𝐹 = 𝐴𝐵 + 𝐴𝐵′ 𝐶 + 𝐴𝐵′ 𝐶′
= 𝐴(𝐵 + 𝐵 )
= 𝐴. 1 = 𝐴(𝐵 + 𝐵′ 𝐶 + 𝐵′ 𝐶′)
=𝐴 = 𝐴(𝐵 + 𝐵′ 𝐶 + 𝐶 ′ )
Truth Table
= 𝐴 𝐵 + 𝐵′ . 1
A B F=AB
+AB’ = 𝐴 𝐵 + 𝐵′

0 0 0 = 𝐴. 1
0 1 0
=𝐴
1 0 1
1 1 1
 13

Introduction to Digital Electronics

Boolean Algebra
Example Problems of Boolean Algebra
Example-3 Example-4
𝐺 = 𝐴 + 𝐵 (𝐴 + 𝐵′ )(𝐴′ + 𝐵)(𝐴′ + 𝐵′ ) 𝑋 = 𝐿𝑀𝑁 + 𝑀𝐿

= (𝐴 + 𝐵𝐵′ )(𝐴′ + 𝐵𝐵′ ) = 𝑀𝐿𝑁 + 𝑀𝐿

= (𝐴 + 0)(𝐴′ + 0) = 𝑀𝐿(𝑁 + 1)

= 𝐴. 𝐴′ = 𝑀𝐿. 1

=0 = 𝑀𝐿
 14

Introduction to Digital Electronics

Boolean Algebra
Example Problems of Boolean Algebra
Example-5
𝑇 = 𝐴𝐵 + 𝐵(𝐵 + 𝐶′) + 𝐵′ 𝐶

= 𝐴𝐵 + 𝐵𝐵 + 𝐵𝐶′ + 𝐵′ 𝐶 =

𝐴𝐵 + 𝐵 + 𝐵𝐶 ′ + 𝐵′𝐶

= 𝐵 𝐴 + 1 + 𝐶 ′ + 𝐵′𝐶

= 𝐵 𝑨 + 𝑪′ + 𝟏 + B′C

= 𝐵. 1 + 𝐵′ 𝐶

= 𝐵 + 𝐵′ 𝐶

=𝐵+𝐶
 15

Introduction to Digital Electronics

Boolean Algebra
 16

Introduction to Digital Electronics

Boolean Algebra
 17

Introduction to Digital Electronics

Boolean Algebra

(SOP)

variables.

▪ Treat ones in the truth table as uncomplemented variables,

and zeros as complemented variables.
▪ Drop terms corresponding to an output of zero in the truth
table
 18

Introduction to Digital Electronics

Boolean Algebra
 19

Introduction to Digital Electronics

Boolean Algebra

(POS)
▪ Treat zeros in the truth table as uncomplemented
variables, and ones as complemented variables.
▪ Drop terms corresponding to an output of one in the
truth table
L = (B1+B2). (B1+B2’). (B1’+B2). (B1’+B2’)

= (B1+B2). (B1+B2’). (B1’+B2’)

= [B1 B1 + B2′ + B2(B1 + B2′ )](B1′ + B2′ )

= (𝐵1 + 𝐵1. 𝐵2)(𝐵1′ + 𝐵2′ )

= 𝐵1′ 𝐵1 + 𝐵1. 𝐵2 + 𝐵2′(𝐵1 + 𝐵1. 𝐵2)

= 𝐵1′ . 𝐵1 + 𝐵1′ . 𝐵1. 𝐵2 + 𝐵2′ . 𝐵1 + 𝐵2′ . 𝐵1. 𝐵2

L = 𝐵1. 𝐵2
 20

Introduction to Digital Electronics

Boolean Simplification Let’s simplify

= 𝐵1. 𝐵1. 𝐵2 + 𝐵2

= 𝐵1. 𝐵1. 𝐵2 + 𝐵1. 𝐵2 = 𝐵1. 𝐵2 + 𝐵1. 𝐵2

= 𝐵1. (𝐵2 + 𝐵2) = 𝐵1.1 = 𝐵1

𝑦 = 𝐵1
Let’s simplify

= 𝐵1. 𝐵1 + 𝐵2 + 𝐵2. (𝐵1 + 𝐵2)

= 𝐵1. 𝐵1 + 𝐵1. 𝐵2 + 𝐵1. 𝐵2

= 𝐵1 + 𝐵1. 𝐵2 + 𝐵1. 𝐵2

= 𝐵1 + 𝐵1. (𝐵2 + 𝐵2) = 𝐵1 + 𝐵1.1 = 𝐵1 + 𝐵1

𝑦 = 𝐵1
 21

Introduction to Digital Electronics

Boolean Simplification

Let’s simplify

= 𝐵2. 𝐵1. 𝐵2 + 𝐵1

= 𝐵2. 𝐵1. 𝐵2 + 𝐵2. 𝐵1 = 𝐵2. 𝐵1 + 𝐵1. 𝐵2

= 𝐵2. (𝐵1 + 𝐵1) = 𝐵2.1 = 𝐵2

𝑦 = 𝐵2
 22

Introduction to Digital Electronics

Boolean Algebra
 23

Introduction to Digital Electronics

Boolean Simplification Binary Truth Table
S1 S2 S3 M

Device operation can often be

defined in a Truth Table as
follows:

OFF
OFF
ON ❖ Both S1 and S3
ON change values while
S2 remains fixed

ON ❖ The result of the

minimization should
ON be
M = S2
 24

Introduction to Digital Electronics

(SOP)
S1 S2 S3 M 0
𝑀 = 𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3 +
𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3+S1. 𝑆2. 𝑆3

𝑀 = 𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3 + 𝑆1. 𝑆2. 𝑆3+S1. 𝑆2. 𝑆3

𝑀 = 𝑆1. 𝑆2(𝑆3 + 𝑆3) + 𝑆1. 𝑆2(𝑆3+S3)

𝑀 = 𝑆1. 𝑆2.1 + 𝑆1. 𝑆2.1

𝑀 = 𝑆1. 𝑆2 + 𝑆1. 𝑆2
𝑀 = 𝑆2(𝑆1 + 𝑆1)
𝑀 = 𝑆2.1
𝑀 = 𝑆2
 25

Introduction to Digital Electronics

(POS) 0

S1
𝑀
S2 S3 M
= 𝑆1 + 𝑆2 + 𝑆3 . 𝑆1 + 𝑆2 + 𝑆3′ . 𝑆1 + 𝑆2′ + 𝑆3 . (𝑆1 + 𝑆2′
+ 𝑆3′ ). 𝑆1′ + 𝑆2 + 𝑆3 . 𝑆1′ + 𝑆2 + 𝑆3′ . 𝑆1′ + 𝑆2′ + 𝑆3 . (𝑆1′ + 𝑆2′
+ 𝑆3′ )
𝑀 = 𝑆1 + 𝑆2 + 𝑆3 . 𝑆1 + 𝑆2 + 𝑆3′ . 𝑆1′ + 𝑆2 + 𝑆3 . 𝑆1′ + 𝑆2 + 𝑆3′
Let, 𝑀 = 𝑋. 𝑌
𝑋 = (𝑆1 + 𝑆2). (𝑆1 + 𝑆2 + 𝑆3′ ) + 𝑆3. (𝑆1 + 𝑆2 + 𝑆3′ )
𝑋 = 𝑆1 + 𝑆2 + 𝑆3. 𝑆1 + 𝑆2 = 𝑆1 + 𝑆2 1 + 𝑆3 = 𝑆1 + 𝑆2
𝑋 = 𝑆1 + 𝑆2
𝑌 = 𝑆1′(𝑆1′ + 𝑆2 + 𝑆3′) + 𝑆2(𝑆1′ + 𝑆2 + 𝑆3′ ) + 𝑆3(𝑆1′ + 𝑆2 + 𝑆3′)
𝑌 = 𝑆1′ + 𝑆2 + 𝑆3 𝑆1′ + 𝑆2 = 𝑆1′ + 𝑆2
𝑀 = (𝑆1 + 𝑆2). (𝑆1′ + 𝑆2)
𝑀 = 𝑆1 𝑆1′ + 𝑆2 + 𝑆2 𝑆1′ + 𝑆2
𝑀 = 𝑆1𝑆2 + 𝑆2 = S2 1 + S3 = S2 𝑴 = 𝑺𝟐
 26

Introduction to Digital Electronics

Boolean Algebra
Logic Circuit Simplification

Let’s consider the logic circuit below. Assuming the input signals “A”, “B”
and “C” are provided from switches, sensors or other gate circuits.
 27

Introduction to Digital Electronics

Boolean Algebra
Logic Circuit Simplification

Step-1:
Write a Boolean expression for the output.
 28

Introduction to Digital Electronics

Boolean Algebra
Logic Circuit Simplification
Step-2:
Simplify the Boolean expression for the output by using either
Boolean algebra or K-Mapping for reducing the number of
gates.
𝑄𝑄 = 𝐴𝐵 + 𝐵𝐶(𝐵 + 𝐶)
⇒ 𝑄 = 𝐴𝐵 + 𝐵𝐵𝐶 + 𝐵𝐶𝐶
𝑄 ⇒ 𝑄 = 𝐴𝐵 + 𝐵𝐶 + 𝐵𝐶
𝑄 ⇒ 𝑄 = 𝐴𝐵 + 𝐵𝐶
𝑄 ⇒ 𝑄 = 𝐵(𝐴 + 𝐶)
Step-3:
Draw the simplified logic circuits.
 29

Introduction to Digital Electronics

Boolean Algebra
Logic Circuit Simplification
Step-4:
Check both the original and reduced circuits using truth table.
 30

Introduction to Digital Electronics

Boolean Algebra
Logic Circuit Simplification
Another Example
Simplify the following circuit.

A+B
A 𝑄𝐹𝑄 = 𝐴 + 𝐵 . 𝐵 + 𝐶ҧ )
B
Q
B 𝑄𝐹𝑄 = 𝐴 + 𝐵 + (𝐵 + 𝐶)ҧ

C 𝑄𝐹𝑄 = 𝐴 + 𝐵 + 𝐵 + 𝐶ҧ
B+C
C
𝑄𝐹𝑄 = 𝐴 + 𝐵 + 𝐶ҧ
Simplified circuit.

A
B
Q
C
 31

Introduction to Digital Electronics

Practice Problems
1. Simplify the following Boolean Expressions:
(i) 𝐴𝐵 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶𝐷 + 𝐴𝐵𝐶𝐷𝐸 + 𝐴𝐵𝐶𝐷𝐸𝐹
(ii) 𝑋𝑍 + 𝑍(𝑋ത + 𝑋𝑌)
(iii) 𝐴 + 𝐵 + 𝐶 + (𝐴 + 𝐵 + 𝐶)(𝐷 + 𝐸)
(iv) 𝐴𝐵ത + 𝐴𝐵ҧ (𝐴 + 𝐵)
(v) 𝐴𝐵.ത 𝐴 + 𝐶 + 𝐴𝐵.ҧ 𝐴 + 𝐵ത + 𝐶ҧ

2. Using SOP or POS methods , find the simplified Boolean

expression for the following control circuit:
(i)
 32

Introduction to Digital Electronics

Practice Problems

(ii)

(iii)
 33

Introduction to Digital Electronics

Practice Problems

3. Draw the more simplified logic circuit of

the following:

B
Q
C