Chapter 4

Boolean Algebra and

Logic Simplification

By Taweesak Reungpeerakul

241-208 CH4 1
 Contents

Boolean Operations & Expressions

Rules of Boolean Algebra

DeMorgans Theorems

Simplification Using Boolean Algebra

Standard Forms of Boolean Algebra

Karnaugh Map

Five-variable Karnaugh Map
241-208 CH4 2
 4.1 Boolean Operations &
Expressions

Boolean Addition is
Boolean multiplication
equivalent to the OR is equivalent to the
operation. AND operation.
0+0 = 0 00 = 0
0+1 = 1 01 = 0
1+0 = 1 10 = 0
1+1 = 1 11 = 1

241-208 CH4 3
 4.2 Laws&Rules of Boolean
Algebra
Laws (CAD)
Commutative, Associative, and Distributive

A+B = B+A (C for addition)

AB = BA (C for multiplication)
A+ (B+C) = (A+B)+C (A for addition)
A(BC) = (AB)C (A for multiplication)
A(B+C) = AB+AC (distributive)

241-208 CH4 4
 4.2 Laws&Rules of Boolean
Algebra (cont.)
1) A+0=A 10) AA=A
2) A+1=1 11) AA=0
3) A0=0 12) A=A
4) A1=1
5) A+A=A Rules of Boolean Algebra
6) A+A=1
7) A+AB=A
8) A+AB=A+B
9) (A+B)(A+C)=A+BC
241-208 CH4 5
 4.3 DeMorgans Theorems

The complement of a product of variables is equal to the
sum of the complements of the variables.
XY = X + Y

The complement of a sum of variables is equal to the

product of complements of the variables.
X + Y = X Y

241-208 CH4 6
 Examples of DeMorgans
Theorems

Ex#1: (AB+C)(BC)
Ex# 2: AB + CDE

= (AB+C) +(BC) = (AB) (CDE)
= (AB)C +(B+C) = (A+B) (CD+E)
= (A+B)C + B+C = (A+B) (CD+E)

Question: (A+B)CD Question: A+B+C+ DE

Ans: (A B)+C+D Ans: A B C+D+E

241-208 CH4 7
 4.4 Boolean Analysis of Logic Circuits

You should be able to:

Determine the Boolean expression for a

combination logic gates.

Evaluate the logic operation of a circuit

from the Boolean expression

Construct a truth table

241-208 CH4 8
 4.4 Boolean Analysis of Logic Circuits
(cont.)
Truth Table
A A B C D (AB+C)D
AB
0 0 0 0 0
B 0 0 0 1 0
AB+C 0 0 1 0 0
0 0 1 1 1
C 0 1 0 0 0
0 1 0 1 0
D 0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
(AB+C)D 1 0 1 0 0
1 0 1 1 1
Cause 1 when D and (AB+C) = 1 1 1 0 0 0
If AB = 0, C = 1 1 1 0 1 1
If AB = 1, C = 0 or 1 1 1 1 0 0
1 1 1 1 1
AB = 1 when both A = B = 1
241-208 CH4 9
 4.5 Simplification using Boolean
Algebra

EX#1: AB+A(B+C)+B(B+C)
Use distributive law A(B+C) = AB+AC

= AB+AB+AC+BB+BC
Use rule #5, A+A = A then A+A = A

= AB + AC + B + BC
Use distributive law A(B+C) = AB+AC

= AB+AC+B(1+C)
Use rule #2 (1+A) = 1

241-208 CH4 10
 4.5 Simplification using Boolean
Algebra (cont.)

= AB+AC+B
Use commutative law A+B = B+A
= AB+B+AC
Use commutative law A+B = B+A, AB = BA
= B+BA+AC
Use distributive law A(B+C) = AB+AC
= B(1+A)+AC
Use rule #2 (1+A) = 1
= B+AC Answer

241-208 CH4 11
 4.5 Simplification using Boolean
Algebra (cont.)
Can u follow up this example by yourself ?

EX#2:
A B C+A B C+A B C+A B C+A B C

= B C+A B C+A B C+A B C

= B C+ B C+A B C

= BC+B(C+AC) Use rule #11 A+AB = A+B

= BC+B(C+A)

= BC+B C+AB Answer

How about try more questions, for example :

Questions in pp. 179 !!!!
241-208 CH4 12
 4.6 Standard Forms of Boolean
Expressions

Sum-of-Products (SOP):
Standard SOP Form:

2 or more product terms are summed all variables in the domain appear
by Boolean addition such as in each product term such as
AB+ABC+AC ABC+ABC+ABC

Ex# 1: (A+B)(C+D)  SOP form Ex# 1: AB+ABC  standard SOP

= AC+AD+BC+BD = AB(C+C)+ABC = ABC+ABC+ABC
Ex# 2: B+ABC
Ex# 2: (A + B) + C = B(A+A)+ABC = AB+AB+ABC
= AC + BC = AB(C+C)+AB(C+C)+ABC
= ABC+ABC+ABC+ABC+ABC

241-208 CH4 13
 Standard Forms (cont.)

Product-of-Sum (POS):
2 or more sum terms are multiplied
such as (A+B)(A+B+C)

Standard POS:
all variables in the domain appear in
each sum term such as
(A+B+C)(A+B+C)

Ex# 1: (A+C)(A+B+C)
 standard POS
= (A+C+BB)(A+B+C)

=(A+B+C) (A+B+C) (A+B+C)

Question: (A+C)(A+B)  std. POS
Ans: (A+B+C) (A+B+C) (A+B+C)(A+B+C)
241-208 CH4 14
 Std. SOP to std. POS
Example: ABC+ABC+ABC+ABC+ABC
101 011 100 001 000
3 variables
23 = 8 possible combinations
Remained terms: 111, 110, 010
Std. POS = (A+B+C)(A+B+C)(A+B+C)

241-208 CH4 15
 4.7 Boolean Expressions and
Truth Tables

SOP  Truth Table
POS Truth Table
EX: ABC+ABC+ABC+ABC EX: (A+B+C)(A+B+C)(A+B+C)
000 010 101 110 out=1 100 010 011 out=0
A B C Out A B C Out
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 1 0 1 0 1 0 0
0 1 1 0 0 1 1 0
1 0 0 0 1 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 1
1 1 1 0 1 1 1 1

241-208 CH4 16
 4.8 The Karnaugh Map

The Karnaugh map is an array of cells in which each cell
represents a binary value of the input variables.

The number of cells is 2n, n is number of variables

C 0 1 3 Variables
AB
00 ABC ABC

01 ABC ABC

11 ABC ABC

10 ABC ABC Question: 4 variables Karnaugh map

241-208 CH4 1
 4.9 Karnaugh Map SOP Minimization
Ex1: Map and minimize the following std. SOP expression on a
Karnaugh map: A B C+ABC+ABC+A B C
000 001 110 100
AB
BC 00 01 11 10
A
1 1 0 1
1

1 1 1 1 1

AC

Answer: A B+AC
241-208 CH4 2
 SOP Minimization (cont.)
Ex2: Map and minimize the following SOP expression on a
Karnaugh map: A B +ABC+A B C

110 111 010 011 B

BC 00 01 11 10
A
1 1 0 1 1

1 1 1 1 1

Answer: B

241-208 CH4 3
 Karnaugh Map Simplification

Grouping 1s
- Each group must contain 1,2,4,8,or 16
- Each cell in a group must be adjacent to one or more cells in
that same group, but all cells in the group do not have to be
adjacent to each other.
- Always include the largest possible number of 1s in a group
- Each 1 on the map must be included in at least one group.
The 1s already in a group can be included in another group as
long as the overlapping groups include non-common 1s.

241-208 CH4 4
 Group the 1s in each of the Karnaugh
maps
ABC AC BC
BC ABC D

1 1
1 1
1 1
1 1 1
AB AB C
BC 00 01 11 10
A 1 1 1
0 1 1 1
1 1 1
1 1 1 1

241-208 CH4 5
 4.10 Karnaugh Map POS Minimization
Ex1: Map and minimize the following std. POS expression on a
Karnaugh map:
(A+B+C)(A+B+C)(A+B+C)(A+B+C)
000 001 111 110 A+B
BC 00 01 11 10
A
0 0 0 0
0

0 0 1 0 0

A+B

Answer: (A+B)(A+B)
241-208 CH4 6
 SOP Minimization (cont.)
Ex2: Map and minimize the following POS expression on a
Karnaugh map:
(A+B)(A+B+C)(A+B+C)

000 001 010 011 A

BC 00 01 11 10
A
0 0 0 0 0 0 0 0 0

Answer: A
241-208 CH4 7
 Karnaugh maps Simplification of POS
Expressions
(B+C+D)(A+C+D)(A+B+C+D)(A+B+C+D)(A+B+C+D)

0000 1000 0010 0110 1011 1001 1010

(B+D)
(A+C+D)

0 0

(A+B)

0 0 0 0

Answer: (B+D)(A+B)(A+C+D)
241-208 CH4 8
 Converting Between POS and SOP Using
Karnaugh Map
(B+C+D)(A+C+D)(A+B+C+D)(A+B+C+D)(A+B+C+D)

0000 1000 0010 0110 1011 1001 1010

(B+D) BC AD
(A+C+D)

0 0 0 1 1 0
0 1 1 1 0
AB
(A+B) 1 1 1 1

0 0 0 0 0 0 0 0

Min POS: (B+D)(A+B)(A+C+D)

Min SOP: AB+BC+AD
241-208 CH4 9
 Mapping Directly from a Truth Table
A B C Out
0 0 0 1
1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1 1 x
1 0 1 0
1
1 1 0 1
1 1 1 x
Out = AB+BC

241-208 CH4 10
 7-segment decoding Logic
Digit D C B A a b c d e f g
0 0 0 0 0 1 1 1 1 1 1 0
1 0 0 0 1 0 1 1 0 0 0 0
2 0 0 1 0 1 1 0 1 1 0 1
3 0 0 1 1 1 1 1 1 0 0 1
4 0 1 0 0 0 1 1 0 0 1 1
5 0 1 0 1 1 0 1 1 0 1 1
6 0 1 1 0 1 0 1 1 1 1 1
7 0 1 1 1 1 1 1 0 0 0 0
8 1 0 0 0 1 1 1 1 1 1 1
9 1 0 0 1 1 1 1 1 0 1 1
10 1 0 1 0 x x x x x x x
11 1 0 1 1 x x x x x x x
12 1 1 0 0 x x x x x x x
13 1 1 0 1 x x x x x x x
14 1 1 1 0 x x x x x x x
15 1 1 1 1 x x x x x x x

241-208 CH4 11
 Karnaugh Map Minimization of the
Segment Logic
SOP for segment a:
DC BA+DCBA+DCBA+ DCBA+DCBA+DCBA+DC BA+DCBA
CA
BA
00 01 11 10
DC
00 1 1 1
CA B
01 1 1 1

D 11 x x x x

10 1 1 x x

Minimum SOP expression: D+B+CA+CA

241-208 CH4 12