Chapter Three

1 Part Two
Boolean Algebra and Logic Simplification

Basic points
• Boolean Operation and Expression
• Laws and Rules of Boolean Algebra
• DeMorgans Theorem
• Simplification Using Boolean Algebra
• Standard forms of Boolean Expression
• K-Map
2 Chapter Three
3 Chapter Three
4 Chapter Three
5 Chapter Three
6 Chapter Three
7 Chapter Three
8 Chapter Three
9 Chapter Three
10 Chapter Three
11 Chapter Three
12 Chapter Three
13 Chapter Three
14 Chapter Three
15 Chapter Three
16 Chapter Three

Simplification Using Boolean Algebra

• Using Boolean algebra techniques, simplify this expression:
AB + A(B + C) + B(B + C)
• Solution
Step 1: Apply the distributive law to the second and third terms
in the expression, as follows:
AB + AB + AC + BB + BC
Step 2: Apply rule 7 (BB = B) to the fourth term.
AB + AB + AC + B + BC
Step 3: Apply rule 5 (AB + AB = AB) to the first two terms.
AB + AC + B + BC
Step 4: Apply rule 10 (B + BC = B) to the last two terms.
16 Chapter Three

AB + AC + B
Step 5: Apply rule 10 (AB + B = B) to the first and third terms.
B+AC
At this point the expression is simplified as much as possible.
18 Chapter Three
19 Chapter Three
20 Chapter Three

ªWhen two or more product terms are summed by Boolean addition the

result expressed by SOP.

ªA SOP expression can be implemented by AND-OR logic gate.

ªImplementing simply requires ORing the output of two or more AND gates.

E.g. AB+ABC

ABC+CDE+B’CD’

ªDomain of a Boolean Expression:- The domain of general Boolean expression is

the set of variables contained in the expression in either complemented or

uncomplemented form. E.g. ABC’+CD’E+B’CD’ Is the set of variables A,B,C,D,E.

21 Chapter Three

• Converting a truth table to an SOP expression

1. Each row with output of 1 becomes a product term.
2. Sum the product terms together.
22 Chapter Three

• Number of 1’s in truth table output column equals AND terms for Sum-of-Products
(SOP)
23 Chapter Three
24 Chapter Three
25 Chapter Three

Converting truth table to POS Expressions

26 Chapter Three
27 Chapter Three

• To convert from standard SOP to standard POS

Evaluate each product term in the SOP expression.Determine the

binary numbers that represent the product terms.

‚ Determine all of the binary numbers not included in the evaluation

in step 1.

ƒ Write the equivalent sum term for each binary numbers from

Step 2 and express in POS forms.

28 Chapter Three
29 Chapter Three
30 Chapter Three
Minterms and Maxterms
• Minterms(standard product) a binary variable may appear
either in its normal form(x) or in its complement form(x’).
• Now consider two binary variables x and y combined with an
AND operation.
• Since each variable may appear in either form, there are four
possible combinations: x’y’, x’y,xy’, and xy.
• Each of these four AND terms representation is called
minterm (standard product).
• The convenient way of expressing using the sum symbol ∑ N
variables can be combined to form 2n minterms.
• The binary numbers from 0 to 2n -1 are listed under the n
variables.
31 Chapter Three

• Each minterms variable being primed if the corresponding bit

of the binary number is 0 and unprimed if it is 1.
• Minterm is symbolized by mj ,where j denotes the decimal
equivalent of the
binary number of the miniterm.
• Each AND combination of terms is a minterm.
32 Chapter Three

• Minterm representation, select rows with 1’s.

• Minterm number same as row position in truth table.
• Shorthand way to represent functions ∑.
33 Chapter Three
Maxterm
• Maxterms (standard sum) A binary variable may appear either
in its normal form(x) or in its complement form(x’).
• Now consider two binary variables x and y combined with an
OR operation.
• Since each variable may appear in either form, there are four
possible combinations: x’+y’, x’+ y, x+y’, and x+y.
• Each of these four OR terms representation is called
maxterms (standard sum).
• The convenient way of expressing using the product
symbol N variables can be combined to form 2n
maxterms.
• The binary numbers from 0 to 2n -1 are listed under the n
variables.
34 Chapter Three

• Each maxterms variable being unprimed if the

corresponding bit of the binary number is 0 and
primed if it is 1.
• Maxterms is symbolized by Mj ,where j denotes the
decimal equivalent of the binary number of the
maxterm.
• Note that each maxterms is the complement of its
corresponding minterm, and vice versa.
• Each OR combination of terms is a maxterm.
35 Chapter Three
36 Chapter Three

• A Boolean function can be expressed algebraically from a given

truth table by forming a minerms for each combination of
variables that produces a 1 in the function.
Example a) f1 = x’y’z+ xy’z’+ xyz = m1 + m4+ m7

b) f2 = x’yz+ xy’z+ xyz’ + xyz = m3+ m5 + m6+ m7

37 Chapter Three

• A Boolean function can be expressed algebraically from a given

truth table by forming a maxterms for each combination of
variables that produces a 0 in the function.
• using the above truth table form a Boolean function
• f1’(minterms)= f1(maxterm)

f1(maxterms)= (x+y+z)(x+y’+z)(x+y’+z’)(x’+y+z’)(x’+y+z)

= M0*M2*M3*M5*M6

f2’(minterms)= f2(maxterm)

f2(maxterms)= (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z)

= M0*M1*M2*M4
• Boolean functions expressed as a sum of minterms or product
of maxterms are said to be in Canonical form.
38 Chapter Three

Easy to convert between minterm(SOP) and maxterm

•

(POS) representations
•For minterm representation, select rows with 1’s
39 Chapter Three

Karnaugh maps

• A Karnaugh map provides a systematic method for simplifying Boolean

expressions.
• if properly used,it will produce the simplest SOP or POS expression possible,
known as the minimum expression.
• The map method, first proposed by Veitch and modified by Karnaugh, is also
known as the “Veitch diagram” or the “Karnaugh map.”
• The Kmap is a diagram made up of squares. Each square represents one
minterms.
40 Chapter Three
 41 Chapter Three

Karnaugh map for two variable

• There are four minterms for two variables; hence, the map
consists of four square,one for each minterm.
• Notice that A prime appears in row 0 and unprimed in row 1.
Similarly, B prime appears in column 0 and unprimed in column 1.
• The possible values of the variable A are written down the left
hand side of the map, labeling the corresponding row of the map,
• while the possible values of the variable B are written along the
top of the map, labeling the corresponding columns of the map.
42 Chapter Three

• The map show the relation between the squares and the two variables.
• Note that the minterms are arranged in binary sequence, but in sequence
similar to the Gray code.
Example:- F= x’y + xy’ + xy =m1 + m2 + m3
• Mark the three square with 1’s. these squares found from the minterms of the
function. The simplification of F is
F= x + y
43 Chapter Three
Karnaugh map for three variable
• There are eight minterms for three variables; hence, the map consists of
eight square, one for each minterm.
• Notice that A prime appears in row 0 and unprimed in row 1. Similarly, B
prime appears in column 0,1 and unprimed in column 2,3.
• The possible values of the variable A are written down the left hand side of
the map, labelling the corresponding row of the map,
• while the possible values of the variable B and C are written along the top
of the map, labelling the corresponding columns of the map.
44 Chapter Three

• Any two squares in the Kmap differ by only by one variable is called adjacent
squares,
• which is one variable primed in one square and unprimed in the other square.
• For example, m5 and m7 lie in the two adjacent squares. Variable B is primed in

m5 and unprimed in m7, whereas the other two variables are the same in both
squares.
45 Chapter Three
Karnaugh map for four variable

• There are Sixteen minterms for four variables; hence, the map consists
of sixteen square, one for each minterm.
• Notice that A prime appears in row 0,1 and unprimed in row 2,3. and B
prime appears in row 0,3 and unprimed in column 1,2.
• Similarly, C prime appeared in column 0,1 and unprimed in column 2,3 and
D prime appeared in column 0,3 and unprimed appear 1,2.

• The possible values of the variable A and B are written down the left hand side
of the map, labeling the corresponding row of the map,
• While the possible values of the variable C and D are written along the top of the
map, labelling the corresponding columns of the map.
46 Chapter Three

• The Kmap simplification of 4-variable Boolean functions is similar to

the method 3-variable functions.
• Adjacent squares are defined to be square corresponding to each other
square.
• In addition, the map is considered to adjacent even if, it can’t touching
each other.
47 Chapter Three
48 Chapter Three

Mapping Standard SOP

1. Determine the binary value of each product term in

standard SOP expression.
2. As such product term is evaluated, place a 1 on the K-
MAP in the cell having the same value as the product
term.
49 Chapter Three

1 1

1 1

1
1 1
50 Chapter Three
51 Chapter Three
52 Chapter Three
53 Chapter Three
54 Chapter Three
Key Points for 3- Variable K-Map

Key Points for 4- Variable K-Map

55 Chapter Three
56 Chapter Three
57 Chapter Three
59 Selected Key Terms
60 Selected Key Terms