Exercise 4b.
2: According the the example, draw the logic
circuit for the original expression and the
last expression simplified.
Original expression:
Simplified expression:
1
Exercise 4b.3: Convert each of the following Boolean
expressions to SOP form:
(i)
(ii)
(iii)
2
Solution 4b.3: (i)
(ii)
(iii)
(DeMorgan’s Theorem II)
(Apply rule 9)
3
Exercise 4b.4: Define the variables of SOP expression
and convert the expression to
standard SOP form.
Solution 4b.4:
(Apply rule 6)
(Apply rule 5)
4
Exercise 4b.5: Convert the following Boolean expressions
to standard POS form:
Rule 8: (A . Ā) = 0 Rule 12: (A + BC) = (A + B)(A + C)
Solution 4b.5:
5
Exercise 4b.6: Represent the following Boolean expression:
(i) as a sigma notation
(ii)
as a PI notation.
Solution 4b.6(i):
Expression: 110 100 010
Sigma notation:
Solution 4b.6(ii):
Expression:
000 001 010 100
PI notation:
6
Exercise 4b.7:
A Boolean expression is written in sigma notation as
X= . Determine the logic level (binary value) for
each product term and write whole expression.
Solution 4b.7:
Logic level: 111 100 011
Expression:
(SOP)
7
7
Exercise 4b.8:
A Boolean expression is written in PI notation as
X= . Determine the logic level (binary value) for
each sum term and write whole expression.
Solution 4b.8:
Logic level: 111 100 011
Expression:
(POS)
8
8
Exercise 4b.9: Convert the following SOP expressions
to an equivalent POS expression:
Solution 4b.9:
• Step 1: Need to convert the expression into standard
SOP (refer Exercise 4b.7)
ABC + ABC + ABC
• Step 2: Binary number for each SOP term.
Variables = 3 (A, B, C); 23 = 8 possible combinations.
ABC + ABC + ABC
110 100 010 ( 3 combinations)
9
• Step 3: Equivalent sum term for each binary number.
000 001 011 101 111 ( 5 combinations)
(term = 0)
(A + B + C)(A + B + C)(A + B + C) (A + B + C)(A + B + C)
10
Exercise 4b.11:
From the truth table, INPUT OUTPUT
determine the: A B C X
0 0 0 0
(i) standard SOP 0 0 1 0
expression; and 0 1 0 0
(ii) equivalent 0 1 1 1
standard POS 1 0 0 1
expression 1 0 1 0
1 1 0 1
1 1 1 1
11
Solution 4b.11(i):
Convert the binary values to product terms (SOP).
INPUT OUTPUT PRODUCT
A B C X TERMS
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1 ABC Standard SOP expression:
1 0 0 1 ABC
1 0 1 0 ABC + ABC + ABC + ABC
1 1 0 1 ABC
1 1 1 1 ABC
12
Solution 4b.11(ii):
Convert the binary values to sum terms (POS).
INPUT OUTPUT
SUM TERMS
A B C X
0 0 0 0 (A + B + C)
0 0 1 0 (A + B + C)
0 1 0 0 (A + B + C)
0 1 1 1
1 0 0 1
1 0 1 0 (A + B + C)
1 1 0 1
1 1 1 1
Standard POS expression:
(A + B + C) (A + B + C) (A + B + C) (A + B + C)
13
• In a K-map with 4-variable or more, the top-most &
bottom-most cells of a column (and row) are adjacent.
2 cells 4 cells 8 cells
14
15
16
Exercise 4b.12: Map the following SOP expression
on a K-Map:
BC + AB + ABC + ABCD + ABCD + ABCD
Solution 4b.12: Expand the terms by including all
combinations of the missing variables
numerically as follow:
BC + AB + ABC + ABCD + ABCD + ABCD
0000 1000 1100 1010 0001 1011
0001 1001 1101
1000 1010
1001 1011
17
Map each binary values
by placing 1 in the right 1 1
cell of the 4-variables
K-map
1 1
1 1 1 1
BC + AB + ABC + ABCD + ABCD + ABCD
0000 1000 1100 1010 0001 1011
0001 1001 1101
1000 1010
1001 1011
18
Exercise 4b.13: Use a Karnaugh map to minimize the
following standard SOP.
ABC + ABC + ABC + ABC + ABC
Solution 4b.13: The binary values of the expression.
101 011 001 000 100
Map the expression
and group the cells.
The resulting minimum SOP
Expression is =
B + AC
19
20
21
Exercise 4b.14: Use a Karnaugh map to minimize a standard
SOP expression .
(Use “don’t care” terms, into the
K-maps to produce better results)
Solution 4b.14: The binary values of the expression.
101 011 001 000 100
The binary value of “don’t care” notation.
1
110 111
Map the expression and group the cells.
X X
1 1 Expression:
22
Exercise 4b.15: Use a Karnaugh map to minimize an expression
.
(Use “don’t care” terms, into the
K-maps to produce better results)
23
Exercise 4b.16: Transform the following expression
into the K-Map. Then, generate the
simplified expression from the K-Map.
Solution 4b.16: Expand the expression to SOP form.
…….apply DeMorgan Theorem
…….apply distributive law
…….apply Rule 7
Floyd T.L. (2009), “Digital Fundamentals”, 10th Edition, Prentice Hall, USA (pp.188) 24
Make the standard form expression.
…….apply Rule 6
Rule 5
Rule 5
25
Get the binary value for each term.
011 010 001 000 100
Fill in the K-Map and grouping cells.
1
26
26
Exercise 4b.17: Using the same expression in exercise
4b.16, simplify the expression using the
Boolean algebra and laws.
Solution 4b.17: Expand the expression to SOP form.
…….apply DeMorgan Theorem
…….apply distributive law
…….apply Rule 7
Floyd T.L. (2009), “Digital Fundamentals”, 10th Edition, Prentice Hall, USA (pp.188) 27
Simplify the expression.
…….apply Rule 10
…….apply Rule 10
Compare your answer with Exercise 4b.16
28