Lovely Jean L.

Maureal Logics, Circuits, & Switching Theory

EcE 3B Problem Set 6

Minimal SOP Forms

a) 𝒇𝟏 𝒂, 𝒃, 𝒄 = σ 𝒎 𝟎, 𝟏, 𝟑, 𝟓
𝒇𝟐 𝒂, 𝒃, 𝒄 = σ 𝒎 𝟐, 𝟑, 𝟓, 𝟔
𝒇𝟑 𝒂, 𝒃, 𝒄 = σ 𝒎 𝟎, 𝟏, 𝟔

𝑓1 = σ𝑚(0,1,3,5) 𝑓2 = σ𝑚(2,3,5,6) 𝑓3 = σ𝑚(0,1,6)

c c c
ab 0 1 ab 0 1 ab 0 1

00 1 1 00 00 1 1

01 1 01 1 1 01

11 11 1 11 1

10 1 10 1 10

𝑓1 = 𝑎ത𝑏ത + 𝑎𝑐 ത
ത + 𝑏𝑐 𝑓2 = 𝑎𝑏 ത
ത + 𝑏 𝑐 ҧ + 𝑎 𝑏𝑐 𝑓3 = 𝑎ത𝑏ത + a𝑏𝑐
ത

𝑓1 𝑓2 = σ𝑚(3,5) 𝑓1 𝑓3 = σ𝑚(0,1) 𝑓2 𝑓3 = σ𝑚(6)

c c c
ab 0 1 ab 0 1 ab 0 1

00 00 1 1 00

01 1 01 01

11 11 11 1

10 1 10 10

𝑓1 𝑓2 = 𝑎𝑏𝑐 ത
ത + 𝑎 𝑏𝑐 𝑓1 𝑓3 = 𝑎ത𝑏ത 𝑓2 𝑓3 = 𝑎𝑏 𝑐 ҧ

𝒇𝟏 𝒇𝟐 𝒇𝟑

Prime
f m 0 1 3 5 2 3 5 6 0 1 6
Implicant
1 a 1, 5 ത
𝑏𝑐 x x

1 b 1, 3 𝑎𝑐
ത x X

2 c 2, 6 b𝑐ҧ x x

2 d 2, 3 𝑎𝑏
ത x x

1, 3 e 0, 1 𝑎ത𝑏ത x X x x

1, 2 f 3 𝑎𝑏𝑐
ത x x

1, 2 g 5 ത
𝑎𝑏𝑐 x x

2, 3 h 6 𝑎𝑏𝑐ҧ x x

X X X X X X X X
 𝒇𝟏 𝒇𝟐
Prime
𝒇 3 2 3
Implicant
1 b x
2 c x
2 d x x
1,2 f x x

1= ( b+ f) (c + d) ( d + f)
NOTE:
1= (bd + fd + bf + f) (c + d)
cf = b𝑐ഥ + 𝑎𝑏𝑐
ത
1= [f (1 + b) + bd + fd)] (c + d)
df = 𝑎𝑏 + 𝑎𝑏𝑐
ത
1= [ f (1 + d) + bd] (c + d)
bd = 𝑎𝑐
ത + 𝑎𝑏
ത
1= (f +bd) (c +d)
1= cf + df + bd (1 + c)
1= cf + df +bcd + bd
1= cf + df + bd ( 1 + c)
1= cf + df + bd

Thus, bd represents the lower-cost sets making

b, d, e, g, h the required for each function.
𝑓1 (a, b, c) = b + e + g
𝑓2 (a, b, c) = d + g + h
𝑓3 (a, b, c) = e + h

Final Answer:
f1 (a, b, c) = ഥ
𝒂𝒄 + ഥ ഥ + 𝒂𝒃
𝒂𝒃 ഥ𝒄
𝒂𝒃 + 𝒂ഥ
f2 (a, b, c) = ഥ 𝒃𝒄 + 𝒂𝒃 𝒄ത
f3 (a, b, c) = ഥ
𝒂𝒃ഥ + 𝒂𝒃 𝒄ത
b.) 𝒇𝟏 𝑨, 𝑩, 𝑪, 𝑫 = σ 𝒎 𝟎, 𝟏, 𝟐, 𝟑, 𝟔, 𝟕
𝒇𝟐 𝑨, 𝑩, 𝑪, 𝑫 = σ 𝒎 𝟎, 𝟏, 𝟔, 𝟕, 𝟏𝟒, 𝟏𝟓
𝒇𝟑 𝑨, 𝑩, 𝑪, 𝑫 = σ 𝒎 𝟎, 𝟏, 𝟐, 𝟑, 𝟖, 𝟗

𝑓1 = σ𝑚(0,1,2,3,6,7) 𝑓2 = σ𝑚(0,1,6,7,14,15)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 1 1 1 00 1 1

01 1 1 01 1 1

11 11 1 1

10 10

ҧ ത + 𝐴𝐶
𝑓1 = 𝐴 𝐵 ҧ ҧ ത 𝐶ҧ
𝑓2 = 𝐵𝐶 + 𝐴 𝐵

𝑓3 = σ𝑚(0,1,2,3,8,9) 𝑓1 𝑓2 = σ𝑚(0,1,6,7)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 1 1 1 00 1 1

01 01 1 1

11 11

10 1 1 10

𝑓3 = 𝐵ത 𝐶ҧ + 𝐴 ҧ𝐵ത 𝑓1 𝑓2 = 𝐴 ҧ𝐵ത 𝐶ҧ + 𝐴𝐵𝐶

ҧ

𝑓1 𝑓3 = σ𝑚(0,1,2,3) 𝑓2 𝑓3 = σ𝑚(0,1)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 1 1 1 00 1 1

01 01

11 11

10 10

ҧത
𝑓1 𝑓3 = 𝐴 𝐵 ҧ ത 𝐶ҧ
𝑓2 𝑓3 = 𝐴 𝐵
 𝑓1 𝑓2 𝑓3 = σ𝑚(0,1)

CD
AB 00 01 11 10

00 0 1

01

11

10

ҧ ത 𝐶ҧ
𝑓1 𝑓2 𝑓3 = 𝐴 𝐵

𝒇𝟏 𝒇𝟐 𝒇𝟑
P
f I
m 0 1 2 3 6 7 0 1 6 7 14 15 0 1 2 3 8 9

1 a 2, 3, 6, 7 ഥ
𝑨𝑪 x x x x

2 b 6,7,14,15 𝑩𝑪 x x x x

3 c 0, 1, 8, 9 ഥ𝑪
𝑩 ഥ x x x x

1, 3 d 0, 1, 2, 3 ഥ𝑩
𝑨 ഥ x x x x x x x x

1, 2 e 6, 7 ഥ
𝑨𝑩𝑪 x x x x
1, 2, ഥ𝑩
𝐀 ഥ
f 0, 1 ഥ x x x x x x
3 𝑪
X X X X X X X X X X X X X X X X

𝒇𝟏
1= (a + e) (a + e)
𝒇 Prime 6 7
NOTE:
Implicant 1 = a + ae +ae +e ҧ
𝑎 = 𝐴𝐶
1 a x x 1 = a + ae + e ҧ
𝑒 = 𝐴𝐵𝐶
1,2 e x x 1 = a (1 + e) + e
1 = a+ e

Thus, a represents the lower cost sets

making a, b, c, d, f the required for each
function.
f1 (A, B, C, D) = a + d + f
f 2 (A, B, C, D) = b + f
f 3 (A, B, C, D) = c + d + f

Final Answer:
ഥ 𝑪+ 𝑨
f1 (A, B, C, D) = 𝑨 ഥ𝑩ഥ +𝐀
ഥ𝑩ഥഥ
𝑪
ഥ𝑩
f2 (A, B, C, D) = 𝑩𝑪 + 𝐀 ഥഥ
𝑪
ഥഥ
f3 (A, B, C, D) = 𝑩 ഥ𝑩
𝑪+ 𝑨 ഥ +𝐀
ഥ𝑩ഥഥ
𝑪
c.) 𝒇𝟏 𝑨, 𝑩, 𝑪, 𝑫 = σ 𝒎 𝟒, 𝟓, 𝟏𝟎, 𝟏𝟏, 𝟏𝟐
𝒇𝟐 𝑨, 𝑩, 𝑪, 𝑫 = σ 𝒎 𝟎, 𝟏, 𝟑, 𝟒, 𝟖, 𝟏𝟏
𝒇𝟑 𝑨, 𝑩, 𝑪, 𝑫 = σ 𝒎 𝟎, 𝟒, 𝟏𝟎, 𝟏𝟐, 𝟏𝟒

𝑓1 = σ𝑚(4,5,10,11,12) 𝑓2 = σ𝑚(0,1,3,4,8,11)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 00 1 1 1

01 1 1 01 1

11 1 11

10 1 1 10 1 1
ҧ 𝐶ҧ + 𝐵 𝐶ҧ 𝐷
𝑓1 = 𝐴𝐵 ഥ + 𝐴 𝐵𝐶
ത ҧ ҧ𝐷
𝑓2 = 𝐴 𝐶 ഥ + 𝐴𝐵
ҧ ത 𝐶ҧ + 𝐵𝐶𝐷
ത + 𝐵ത 𝐶ҧ 𝐷
ഥ

𝑓3 = σ𝑚(0,4,10,12,14) 𝑓1 𝑓2 = σ𝑚(4,11)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 1 00

01 1 01 1

11 1 1 11

10 1 10 1

𝑓3 = 𝐴 ҧ𝐶ҧ 𝐷
ഥ + 𝐴𝐶 𝐷
ഥ + 𝐵 𝐶ҧ 𝐷
ഥ ҧ 𝐶ҧ 𝐷
𝑓1 𝑓2 = 𝐴𝐵 ഥ + 𝐴 𝐵𝐶𝐷
ത

𝑓1 𝑓3 = σ𝑚(4,10,12) 𝑓2 𝑓3 = σ𝑚(0,4)

CD CD
AB 00 01 11 10 AB 00 01 11 10

00 00 1

01 1 01 1

11 1 11

10 1 10

𝑓1 𝑓3 = 𝐵𝐶ҧ 𝐷
ഥ + 𝐴 𝐵𝐶
ത 𝐷ഥ ҧ ҧ𝐷
𝑓2 𝑓3 = 𝐴 𝐶 ഥ
 𝑓1 𝑓2 𝑓3 = σ𝑚(0,1)

CD
AB 00 01 11 10

00 0 1

01

11

10

ҧ ത 𝐶ҧ
𝑓1 𝑓2 𝑓3 = 𝐴 𝐵

𝒇𝟏 𝒇𝟐 𝒇𝟑
f PI m 4 5 10 11 12 0 1 3 4 8 11 0 4 10 12 14
1 a 4, 5 ഥ 𝐁 𝐂ത
𝐀 x x
1 b 10, Aഥ
𝐁𝐂 x x
11
2 c 0, 1 ഥ
𝐀𝐁ഥ 𝐂ഥ x x
2 d 0, 8 𝐁ഥ 𝐂ത ഥ
𝐃 x x
2 e 3, 11 ഥ 𝐂𝐃
𝐁 x x
3 f 10, ഥ
𝐀 𝐂𝐃 x x
14
1,3 g 4, 12 𝐁 ഥ𝐂 𝐃
ഥ x x x x
2, 3 h 0, 4 ഥ 𝐂ത 𝐃
𝐀 ഥ x x x x
1, 2 i 11 ഥ D
A 𝐁C x x
1, 3 j 10 Aഥ ഥ
𝐁 𝐂𝐃 x x
1, 2, k 4 ഥ 𝐁 𝐂ത ഥ
𝐀 𝐃 x x x
3
X X X X X X X X X X X X X X

𝒇𝟏
1= (b + j) (b + i)
NOTE:
𝒇 Prime Implicant 6 7
1 = b + ij 𝑏 =Aഥ BC
1 b x x
𝑖 =Aഥ BC D
1,2 i x ഥ
𝑗 = ABCD ഥ
1, 3 j x

Thus, b represents the lower cost sets

making a, b, c, d, e, f, g, h the required for Final Answer:
ഥ 𝐁 𝐂ҧ + A 𝐁
f1 (A, B, C, D) =𝐀 ഥ 𝐂+ 𝐁 ഥ𝐂 𝐃
ഥ
each function.
f1 (A, B, C, D) = a + b + g f2 (A, B, C, D) = ഥ
𝐀𝐁ഥ 𝐂ഥ + 𝐁
ഥ 𝐂ҧ 𝐃
ഥ+𝐁
ഥ𝐂𝐃+𝐀
ഥ 𝐂ҧ 𝐃
ഥ
ഥ + 𝐁 ഥ𝐂 𝐃
f3 (A, B, C, D) = 𝐀 𝐂 𝐃 ഥ +𝐀
ഥ 𝐂ҧ 𝐃
ഥ
f2 (A, B, C, D) = c + d + e + h
f 3 (A, B, C, D) = f + g + h