Generation of Switching Equations from Truth Tables

a	b	c	Min-Term		Max-Term
			Term	Designation	Term	Designation
0	0	0	a’b’c’	m0	a’+b’+c’	M0
0	0	1	a’b’c	m1	a’+b’+c	M1
0	1	0	a’bc’	m2	a’+b+c’	M2
0	1	1	a’bc	m3	a’+b+c	M3
1	0	0	ab’c’	m4	a+b’+c’	M4
1	0	1	ab’c	m5	a+b’+c	M5
1	1	0	abc’	m6	a+b+c’	M6
1	1	1	abc	m7	a+b+c	M7

SOP:

P = ab’c + ab’c’ + abc’ + abc + a’bc

= S (5, 4, 6, 7, 3)

P(a,b,c) = S (5, 4, 6, 7, 3)

POS:

G = (a + b’ + c)(a + b’ + c’)(a + b + c’)(a + b + c)(a’ + b + c)

= P (5, 4, 6, 7, 3)

G(a,b,c) = P (5, 4, 6, 7, 3)

G = wxyz’ + wx’yz’ + w’xyz’ + w’x’yz’

G(w, x, y, z) = S(2, 6, 10, 14)

SOP:

T = f(a, b, c) = (a + b’ + c)(a + b’ + c’)(a’ + b’ + c)

= P (5, 4, 6, 7, 3)

T(a,b,c) = P (1, 4, 5)