1

FACULTY OF COMPUTING
 Simplify using Rules of Boolean
Algebra
(Page: 104)

1 A+0=A
2 A+1=1
3 A 0=0
4 A 1=A
5 A+A=A
6 A+A=1
7 A A=A
8 A A=0
9 A=A
10 A + AB = A
11 A + AB = A + B
12 (A + B)(A + C) = A + BC

2
(Page: 104)
1 A+0=A
2 A+1=1
3 A 0=0
4 A 1=A
5 A+A=A
6 A+A=1
7 A A=A
8 A A=0
9 A=A
10 A + AB = A
11 A + AB = A + B
12 (A + B)(A + C) = A + BC
B(A+AC)

B(A + C)

3
 Ex
tr
a

Exercise 4b.2: According the the example, draw the logic

circuit for the original expression and the
last expression simplified.

Original expression:

ABC + ABC + ABC + ABC + ABC

Simplified expression: BC + AB + BC

4
 Forms of Boolean expressions
• Boolean expression can be converted into one of 2 forms.

A
Forms of Boolean
expressions

SOP POS
(Sum-of-Products) (Product-of-Sum)

ABC + ABC (A + B + C)(A + B + C)

Product term = a term Sum term = a term with

with the product (Boolean the sum (Boolean addition)
multiplication) of literals of literals

5
• Standard form
– SOP ABC + ABC + ABC
– POS ( A + B + C )( A + B + C )( A + B + C )
– A standard SOP / POS form is when ALL the variables
appear in each product term / sum term

• Non standard
– SOP AB + C + ABC
– POS ( B + C )( A + C )( A + B)

6
 Sum-of-Product (SOP)

• The bit 0 is A and 1 is A

• Product term è multiplication ‘.’
• The operator is summation +
• The output truth table / K-Map is 1
• The symbol is å ABC
• SOP = when 2 or more product terms are summed.
• e.g ABP1 + ABCP2
ABCP1 + CDEP2 + BCDP3
• A good writing ABC þ ABC ý
7
• Implementation of the SOP expression
AB + BCD + AC

A
B
B
C X = AB + BCD + AC
D
A
C

8
 Exercise

Convert each of the following Boolean

expressions to SOP form:

(i) AB + B(CD + EF)

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

(iii) (A + B) + C

9
 Exercise Solution
(i) AB + B(CD + EF) = AB + BCD + BEF

(ii) (A + B)(B + C + D)
= (A + B)B + (A + B)C + (A + B)D
= AB + BB + AC + BC + AD + BD

(iii) (A + B) + C

= (A + B)C (DeMorgan’s Theorem II)

= (A + B)C (Apply rule 9)

= AC + BC

10
 Product-of-Sum (SOP)

• The bit 1 is A and 0 is A

• Sum term è addition ‘+’
• The operator is multiplication .
• The output truth table / K-Map is 0
• The symbol is Õ ABC
• POS = when 2 or more sum terms are multiplied.
– (A + B)S1(A + B + C)S2
– (A + B + C)S1(C + D + E)S2(B + C + D)S3
• A good writing
A+ B+C þ A+ B +C ý

11
• Implementation of the POS expression
(A + B)(B + C + D)(A + C)

A
B
B
C X = (A + B)(B + C + D)(A + C)
D
A
C

12
 Standard for Boolean
Expressions (BE)

• Standardization makes the evaluation, simplification, and

implementation of Boolean expressions more systematic and
easier.
• A standard SOP / POS Conversions to
Standard Forms
form is when ALL the
variables appear in each
product term / sum term SOP POS
of the expression.
• There are two method
for each SOP/POS to Rule 6: Rule 8:
A• A = 0 Rule 12:
A + A =1
solve the BE.
(A + BC) = (A + B)(A + C)

13
(a) Sum-of-Product (SOP)
Method 1

Rule 6: (A + Ā)=1

14
 (a) Sum-of-Product (SOP)
Method 1

• Convert this Boolean expression to standard SOP form:

ABC + AB + ABC D
Term 1 Term 2 Term 3
Solution:
• Variables = A, B, C, D.
• What is missing?
– Term 1: missing D
– Term 2: missing C and D
• Complete these terms by applying Boolean rule 6

15
 (a) Sum-of-Product (SOP)
Method 1

Rule 6: (A + Ā)=1

Term 1 : ABC = ABC ( D + D) = ABCD + ABC D

Term 2 : AB = AB(C + C) = ABC + ABC
= ABC(D + D) + ABC(D + D) = ABCD + ABCD + ABCD + ABCD

• Now we have the standard of SOP expression:

ABC + AB + ABC D
= ABCD + ABC D + ABCD + ABC D + ABC D + ABC D + ABC D

16
 Exercise

Define the variables of SOP expression AC + BC

and convert the expression to standard SOP form.

Solution:
AC + BC = AC(B + B) + BC(A + A) (Apply rule 6)

= ABC + ABC + ABC + ABC (Apply rule 5)

= ABC + ABC + ABC

17
 (a) Sum-of-Product (SOP)
Method 2 – Binary Representation

• The bit 0 is A and 1 is A

• Identify a variable that is missing in each term using binary
ABC Term 1 – missing D èit can be 0 ABCD
1 ABCD
AB Term 2 – missing C, D è 00 ABCD
01 ABCD
10 ABCD
11 ABCD

18
From the standard SOP
it is easy to generate
the truth table.

1111

1001

0000

19
 (b) Product-of-Sum (POS)
Method 1

• Standard POS form = where all the variables appear

in each sum term in the expression.
• To convert product terms to standard POS
– Multiply each of the nonstandard term with the missing
term using Boolean algebra rule
Rule8:8: (A . Ā) = 0

– Apply rule
Rule1212:
: A(A
+ BC = (A=+(A
+ BC) B)(A + C) + C)
+ B)(A

– Repeat until all variables appear in each sum term.

20
 (b) Product-of-Sum (POS)
Method 1

• Convert this Boolean expression to standard POS form

( A + B + C )( B + C + D)( A + B + C + D)
Term 1 Term 2 Term 3
Solution:
• Variables = A, B, C, D.
• What is missing?
– Term 1: missing D
– Term 2: missing A

21
• Apply rules 8 and 12
Rule 8: (A . Ā) = 0 Rule 12: (A + BC) = (A + B)(A + C)

Term 1 : A + B + C = A + B + C + D D = ( A + B + C + D)( A + B + C + D)

Term 2 : B + C + D = B + C + D + A A
= ( A + B + C + D)( A + B + C + D)
• Now we have the standard of POS expression:
= (A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)(A + B + C + D)

22
 Exercise

• Convert the following Boolean expressions to standard POS

form: (A + B)(B + C)
Rule 8: (A . Ā) = 0 Rule 12: (A + BC) = (A + B)(A + C)

Solution

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

23
 (b) Product-of-Sum (POS)
Method 2 – Binary Representation
(A + B)(B + C)
Term 1 Term 2
• The bit 1 is A and 0 is A
• Identify a variable that is missing in each term using binary

( A + B + ) Term 1 – missing C èit can be 0 A + B + C

1 A+ B +C
( + B + C ) Term 2 – missing A è 0 A+ B +C
1 A+ B +C

24
 Exercise
Example: Determine the binary value for which following
standard POS expression is equal to 0

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

Solution:
(A + B + C + D) = (0 + 0 + 0 + 0) = 0; A=0, B=0, C=0, D=0

(A + B + C + D) = (0 + 1 + 1 + 0) = 0; A=0, B=1, C=1, D=0

(A + B + C + D) = (1 + 1 + 1 + 1) = 0; A=1, B=1, C=1, D=1

The POS expression equal 0 when ALL of the terms are 0.

25
From the standard POS, ( A + B + C + D)( A + B + C + D)( A + B + C + D )
it is easy to generate the truth table.

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

(A + B + C + D)
0 1 1 0

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

26
Exercise 4b.6: Represent the following Boolean expression:
(i) ABC + ABC + ABC as a sigma notation
(ii) (A + B + C)(A + B + C)(A + B + C)(A + B + C)
as a PI notation.

Solution 4b.6(i):
Expression: ABC + ABC + ABC 110 100 010

Sigma notation: ∑ ABC

(6, 4, 2)

Solution 4b.6(ii):
Expression: (A + B + C)(A + B + C)(A + B + C)(A + B + C)
000 001 010 100
PI notation: ∏ ABC
(0,1, 2, 4)

27
Exercise 4b.7:
A Boolean expression is written in sigma notation as
X= ∑ (7, 4, 3) . Determine the logic level (binary value) for
ABC
each product term and write whole expression.

Solution 4b.7:

∑ ABC
(7, 4, 3) Logic level: 111 100 011

Expression: ABC + ABC + ABC

(SOP)

28
Exercise 4b.8:
A Boolean expression is written in PI notation as
X= ∏ (7, 4, 3). Determine the logic level (binary value) for
ABC
each sum term and write whole expression.

Solution 4b.8:

∏ ABC
(7, 4, 3) Logic level: 111 100 011

Expression: (A + B + C)(A + B + C)(A + B + C)

(POS)

29
Converting Standard
(SOP à POS)

30
Example: Convert the following SOP expression to an equivalent
POS expression.

A B C + A B C + A BC + AB C + A B C

A B C Output
Solution: 0 0 0 1
• Variables = (A, B, C) = 3. So, 23 = 8 0 0 1 0
possible combinations. 0 1 0 1
0 1 1 1
A B C + A B C + A BC + A B C + A B C 1 0 0 0
000 010 011 101 111 1 0 1 1
1 1 0 0
• The SOP have 5 of 8, so POS have
1 1 1 1
the other 3 (001, 100, 110)
è These 3 make
sum term = 0 (A + B + C)(A + B + C)(A + B +C)
0 0 1 1 0 0 1 1 0
31
 Exercise 4b.9: Convert the following SOP expressions
to an equivalent POS expression: AC + BC

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)

32
Boolean Expressions and Truth
Tables

33
 Standard SOP à truth tables
Develop a truth table for the standard SOP expression

ABC + ABC + ABC

Solution • Domain = A, B, C. combinations = 23 = 8

• What binary value makes the product term = 1?
ABC INPUTS OUTPUT PRODUCT
001 =111=1 TERM
A B C X
ABC 0 0 0 0
0 0 1 1 ABC
100 =111=1
0 1 0 0
ABC 0 1 1 0
ABC
111 =111=1 1
1
0
0
0
1
1
0
1 1 0 0
• Fill the truth table 1 1 1 1 ABC

34
 Standard
Standard POS àPOS à truth
truth tables
tables
Develop a truth table for the standard POS expression

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

• Domain = A, B, C. combinations = 23 = 8
• What binary value makes the sum term = 0?

Solution
INPUTS OUTPUT PRODUCT
(A + B + C)(A + B + C)(A + B +C)(A + B + C)(A + B +C) TERM
A B C X
0 0 0 0 1 0 0 1 1 1 0 1 1 1 0 (A + B + C)
0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1
0 0 0 0 0 0 1 0 0 (A + B + C)
0 1 1 0 (A + B + C)
1 0 0 1
• Fill the truth table 1 0 1 0 (A + B + C)
1 1 0 0 (A + B + C)
1 1 1 1

35
Exercise

36