Ministry of Higher Education and Scientific Research

Technology University

Department of Control Engineering and Systems

2019
Standard forms of Boolean expressions
All Boolean expressions regardless of their form, can be converted into either of two
standard forms:

1- The sum of product (SOP) min term .

Sum of product (SOP) min term

When two or more product terms are summed by boolean addition , the resulting
addition is a sum of products (SOP) some examples are :

AB + ABC , AB+ABC+AC

Converting product term into SOP

step1 multiplying each non standard product term by a term made up of the sum of a
missing variable and it's complement
step 2 Repeat step1 until all resulting product terms contain all variables in the
domain complemented and un complemented

Ex 1/ convert each of the following Boolean expression to sum of product (SOP) form:

1- AB+B(CD+EF)
sol/
AB+BCD+BEF

2- (A+B)+C
sol/

(A+B).C=(A+B).C=AC+BC

24
Ex 2/ convert the following expression into standard sum of product (SOP) form:

ABC+AB+ABCD
ABC(D+D)=ABCD+ ABCD
AB(C+C)=ABC+ABC= ABC(D+D)+ABC(D+D)
=A B C D + A B C D + A B C D + A B C D
* The complete standard (SOP) form of original expression is :

ABCD+ABCD+ABCD+ABCD+ABCD+ABCD

Product of sum (POS) (max term)

When two or more sum terms are multiplied, the resulting product of sum (POS) some
examples are :

(A+B). (A+B+C) , (A+B) (A+C)

Converting Sum term to standard (POS)

step 1 add to each non standard product term by a term made up of the product of a
missing variable and it's complement
step 2 Apply rule A+BC=(A+B)(A+C)

step 3 Repeat step1 until all resulting sum terms contain all variables in the domain .

ex/ convert each of the following Boolean expression to product of sum (POS) form:
sol/
(A+B+C)(B+C+D)(A+B+C+D)
(A+B+C)+DD = (A+B+C+D)(A+B+C+D)
(B+C+D)=(B+C+D)+AA
=(A+B+C+D)(A+B+C+D)
*The standard form is
(A+B+C+D)(A+B+C+D)(A+B+C+D)(A+B+C+D) (A+B+C+D)

25
Ex/ Find the function from truth table below :

x y F

0 0 0

0 1 0 max term

1 0 0

1 1 1

F= (x + y)(x + y)(x + y) (max term)

Ex/ Find the function from truth table below

x y F

0 0 0

0 1 0

1 0 1

1 1 1

F= x y + x y (max term)

26
EX/ write the truth table for the following function

1- F1(x1,x2,x3) = m0+m2+m3+m7

2- F2(x1,x2,x3) = M0 . M5 . M7

sol/
x1 x2 x3 F1 F2
0 0 0 1 0
0 0 1 0 1
0 1 0 1 1
0 1 1 1 1
1 0 0 0 1
1 0 1 0 0
1 1 0 0 1
1 1 1 1 0

F1 = x1x2x3+ x1x2x3+ x1x2x3+ x1x2x3

F2 = (x1+x2+x3) (x1+x2+x3) (x1+x2+x3)

27
Ex/ find the truth table for the following function then draw (plot) the circuit .

F = x(y + z)

x y z F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

x y z

(y + z)
F

28
Ex/ find the function from the following truth table (min term) then draw (plot) the
circuit

x y z F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

sol/
F = xyz + xyz + xyz

x y z

y
F
z

29
Karnaugh map (k-map)

Karnaugh map consists of one square for each possible min term in a function . Thus
a two variable map has four squares , a three variable map has eight squares and a four
variable map has 16 squares as shown below :-

A A A
0 1
B 0 1 B 0 1 B

0 AB AB m0 m2 0 0 2
0

1 AB AB m1 m3 1 1 3
1

2- VARIABLE MAP

AB AB AB
C 00 01 11 10 00 01 11 10 00 01 11 10
C C
0 ABC ABC ABC ABC 0 m0 m2 m6 m4 0 0 2 6 4
1 ABC ABC ABC ABC 1 m1 m3 m7 m5 1 1 3 7 5

3- VARIABLE MAP

mo + m1 = ABC + ABC = AB
m4 + m6 = ABC + ABC = AC
m7 + m5 = ABC + ABC = AC
mo + m4 = ABC + ABC = BC
m1 + m5 = ABC + ABC = BC

AB 00 01 11 01 C AB 00 01 11 01
C
0 1
0 1 11 AC
AB
1 1
1

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

30
 AB

CD 00 01 11 10

00 m0 m4 m12 m8
01 m1 m5 m13 m9
11
m3 m7 m15 m11
10 m2 m6 m14 m10

4- four variable - map

When we plot a function ,we put a 1 in each square corresponding to a min term that
is included in the function and put 0 in a blank those squares not included in the
function . For the function with don't care (d) an d goes in the square for which
the min term is a don't care .

ex 1/ find the function using k-map

F(x1 , x2) = Ʃ (1,2,3) using POS

x1 x2 F x1
0 1
0 0 0 x2
0 0
0 1 1
1

1 0 1

1 1 1

F = (x1+x2)

31
Ex 2/ Simplify the following function by using
1- SOP
2- POS
F(x , y, z) = Ʃ (3,5,6,7,4)

sol/ 1- SOP

x y z F
0 0 0 0
xy
0 0 1 0 00 01 11 10
0 1 0 0 z
0 1 1
0 1 1 1
1 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1 F=x+yz
1 1 1 1

2- POS

XY

00 01 11 10
Z
0 0 0 F = (x + z)(x + y)
1 0

32
 Ex 3 / Simplify the following function using K-map

F= Ʃ (1,3,5 ,7,9,11,12,14,15)
d=(0,13)

AB
CD 00 01 11 10

00 d 1

01 1 1 d 1 F = D +A B
11 1 1 1 1
10
1

Ex 4 / Simplify the following function :

F(A,B,C)= Ʃ (0,2,4,5,6)

AB
00 01 11 10
C
0 1 1 1 1
F=C+AB
1
1

33
 Five - variable K- map
The five variable map is shown below .It consist of 2 four variable A,B,C,D and E .
This mean a five variable map needs 32 square thus 25 = 32 .
Variable A distinguishes between the two maps, as indicated on the top of diagram .

A=0 A=1
DE DE
B 00 01 11 10 B 00 01 11 10

1 1 L1 00 1 1
00

01 1 1 01 1
L2
11 11 1
L3
10 10 1

L1 = BCD
L2 = ADB
L3 = ADE

Q / Simplify the following function with don't care condition find POS then draw
logic circuit using NOR gates only K-map

F (A,B,C,D,E) =Ʃ (2,6,9,11,13,15,18,25,31)
d (A,B,C,D,E) =Ʃ(22,27,29)

34
Ex / Design a combinational circuit that accepts a-2 bit number and generates
the output which is equal to the square of the input number .

A B X Y Z W
0 0 0 0 0 0
0 1 0 0 0 1
1 0 0 1 0 0
1 1 1 0 0 1

X = AB

Y = AB

Z=0

W = AB + AB = B (A + A) = B

A
X

Y
B

0 Z

35
Ex / Design a logic circuit which has four inputs and one output (T) , as shown below .
N1 and N2 represent two binary number . Each has the output (T) . T is (1) only when
the sum of N1 + N2 is greater than 3 . Simplify the output using k - map .

A
N1 logic
B
C T
N2
D circuit

sol /
A B C D T
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

36
 AB
00 01 11 10
CD
00

01 1 1 L1= ABD

11 1 1 1

10 1 1 L2= AC

L3= BCD

T = ABD + AC + BCD

37