The Truth Table (T T)

Ex.1 3 Variables

For the function F = X’ Y + Z sop numeric form

a) Show the Truth Table
b) Show the equation F in (sum of minterms (SOM)) algebraic form
Or ( Sum opF Products (SOP)
Or (Disjunctive form)
c) Show the equation F in (Product of Maxterm (POM))
Or ( Product of Sum (POS)
Or (Conjunctive form)
d) Show the equation of the complement of F in SOM.
Ans. F'

F = X’ Y + Z 3
3 var. >>>> 2
a) The Truth Table x , y ,z 8 prob.
F' = inputs output
(0,4,6) x 0:7
y z x' x'.y F = x'y + z F'
1's
0 0 0 0 1 0 0 1
1) SOM (canonical form)
x'y'z 1 0 0 1 1 0 1 0
2 0 1 0 1 1 1 0 - numeric form
x'yz'
3 0 1 1 1 1 1 0 F(x,y,z) = (1,2,3,5,7)
x'yz
4 1 0 0 0 0 0 1 - Algebric form
xy'z 5 1 0 1 0 0 1 0 F(x,y,z)=
6 1 1 0 0 0 0 1
x'y'z + x'yz' + x'yz +
7 1 1 1 0 0 1 0
xyz xy'z+xyz
SOP
2 ) Product of Maxterms ( 0's) POM (canonical form)
- numeric form => F(x,y,z) = (0,4,6)
- Algebric form => F(x,y,z) = (x+y+z)(x'+y+z)(x'+y'+z) >>>> POS
b)
The sum of minterms >>> SOM
(from one’s of “F” )

C)
The Product of Maxterms >>> POM
(from zero’s of “F”)

D)
The complement of F in SOM.
F'

Canonical Form
 4 2 1
Ex.2
1 1 1
For the function F = ∑ m (1,2,6,7) 3 bits
a) Show the Truth Table 3 variables
b) Show an algebraic expression in SOP (Canonical form)
c) Show the minimum sum of product expression.
d) Show the minterms of F’ (complement of f) in numeric form
and in algebraic form.

Ans.
let: the 3 variables are
A,B,C
a)
8 prob. >>>> 0 : 7
The Truth Table
outputs
INPUTS
A B C F F'
0 0 0 0 0 1 Algebric expression in SOM
1 0 0 1 1 0
(Canonical form)
2 0 1 0 1 0
3 0 1 1 0 1
0 F (A,B,C)=
4 1 0 0 1
5 1 1 0 1 A'B'C + A'BC' + ABC' + ABC
0
6 1 1 0 1 0
7 1 1 1 1 0

F' in numeric form = (0 , 3,4,5)

b) Algebraic form in SOP: F' in algebric form=

A'B'C' + A'BC + AB'C' + AB'C
 c) The minimum of SOP:

F ( A , B , C) = A’B’C + A’BC’ + ABC’ + ABC

AB (C' + C)

= A'B'C + A'BC' + AB
B ( A'C' + A)
B ( A+A')(A+C')

= A'B'C + AB + BC' >>>>> minimum SOP

d) The minterms of F’ :

Numeric form:

Algebraic form:
 Dual of a Boolean Expression

 The dual of an algebraic expression is obtained by

interchanging
o OR <-> AND ( + <-> . ) f = x'y+xz
o 0’s <-> 1’s f ' = (x+y') .(x'+z') <<<
Demorgan's theorem

Ex.1
Find the dual of the following equation:
F = (A + C) · B + 0

the dual of F = A.C+B.1

Fd = AC+B

Ex.2
Find the dual of the following equation:
G = X · Y + (W + Z)
G = X.Y + W'.Z'

The dual of G = (X+Y).(W'+Z')

Gd
Ex.3
Find the dual of the following equation: H Hd

H = (A · B)+ A · C + B · C
d
The dual of H ( H ) = (A+B).(A+C).(B+C)

Is the dual of the equation is self-dual?

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

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

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

= [A (1 + C + B) + BC] (B+C)

= (A +BC)(B+C)

= AB + AC +BC + BC

= AB + AC + BC >>>> Self dual

 Circuit Optimization

 It is used to obtain the simplest implementation for a

given function.
 3 cost criteria are used to measure the simplicity of a
circuit.
o Literal Cost (L)
 L = Number of all variables and it’s
complemented

o Gate input cost (G)

 G = L + no. of terms.

o cost including inverters (GN)

Gate input case
 GN = G + no. of inverters

Ex.1 F = A.(B+C)(C'+D)
L= 5 ,,, G = L + 2 = 7
F = BC + B’C’ + A
GN = G + INVERTERS
7+1=8
L = 5 literals

G = L + no. of terms

5+2=7

GN = G + no. of inverters
7+ 2 =9
 Ex.2
POS
F = ( A + C’ ) (B’ + C) (A’ + B)

L=6 A
B
G = L + NO. OF TERMS
C
=6 +3=9

GN = G + No. of inverters F
= 9 + 3 = 12
 Ex. 3
 Use the criteria cost (Literal cost, Gate input cost and
gate input cost with inverters) to show which solution
is best?
L=8 1) F1 = B D + A B’ C + A C’ D’
L = 11 2) F2 = B D + A B’ C + A B’ D’ + A B C’
L = 10 3) F3 = (A + B) ( A + D) + ( B + C + D’ ) (B’ + C’ + D)

Ex.4
 Use the criteria cost (Literal cost, Gate input cost and
gate input cost with inverters) to show which solution
is best?
1) F1 = A B C + A’ B’ C’ L = 6 ,, G = 6+2 = 8
2) F2 = (A + C’ ) ( B’ + C ) ( A’ +B) L =6 ,, G = 6 + 3 = 9