Digital Electronics

CS for RL 1st session

rktiwary

4/29/2016

RKTiwary
BITS,Pilani

T1 2.18
For the Boolean function

a. Obtain the truth table of F

b. Draw the logic diagram using the original Boolean Expression
c. Use Boolean Algebra to simplify the function to a minimum
number of literals
d. Obtain the truth table of the function from the simplified
expression and show that it is the same as the one in part a
e. Draw the logic diagram for the simplified expression and
compare the total no. of gates with the diagram of part b

4/29/2016

RKTiwary
BITS,Pilani

Obtain the truth table of F

w

x
0

4/29/2016

y
0

z
0

xy'z x'y'z w'xy wx'y wxy

RKTiwary
BITS,Pilani

x
0
0

4/29/2016

y
0
0

z
0
0

xy'z x'y'z w'xy wx'y wxy F

0
1

RKTiwary
BITS,Pilani

x
0
0
0

4/29/2016

y
0
0
0

z
0
0
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0

RKTiwary
BITS,Pilani

x
0
0
0
0

4/29/2016

y
0
0
0
0

z
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1

RKTiwary
BITS,Pilani

x
0
0
0
0
0

4/29/2016

y
0
0
0
0
1

z
0
0
1
1
0

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0

RKTiwary
BITS,Pilani

x
0
0
0
0
0
0

4/29/2016

y
0
0
0
0
1
1

z
0
0
1
1
0
0

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1

RKTiwary
BITS,Pilani

x
0
0
0
0
0
0
0

4/29/2016

y
0
0
0
0
1
1
1

z
0
0
1
1
0
0
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0

RKTiwary
BITS,Pilani

x
0
0
0
0
0
0
0
0

4/29/2016

y
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1

RKTiwary
BITS,Pilani

10

x
0
0
0
0
0
0
0
0
1

4/29/2016

y
0
0
0
0
1
1
1
1
0

z
0
0
1
1
0
0
1
1
0

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0

RKTiwary
BITS,Pilani

11

x
0
0
0
0
0
0
0
0
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0

z
0
0
1
1
0
0
1
1
0
0

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1

RKTiwary
BITS,Pilani

12

x
0
0
0
0
0
0
0
0
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0

z
0
0
1
1
0
0
1
1
0
0
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1
0

RKTiwary
BITS,Pilani

13

x
0
0
0
0
0
0
0
0
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0

z
0
0
1
1
0
0
1
1
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1
0
1

RKTiwary
BITS,Pilani

14

x
0
0
0
0
0
0
0
0
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1
0
1
0

RKTiwary
BITS,Pilani

15

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1
0
1
0
1

RKTiwary
BITS,Pilani

16

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0

RKTiwary
BITS,Pilani

17

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
RKTiwary
BITS,Pilani

18

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
RKTiwary
BITS,Pilani

19

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
1
0
0
0
0
1
0
1
0
1
0
1
0
1
0
1
0
1
RKTiwary
BITS,Pilani

0
1

20

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
1
0
0
0
0
0
0
0
0
0
1
0
1
0
1
0
1
0
1
0
1
0
1
RKTiwary
BITS,Pilani

0
1
0

21

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0

RKTiwary
BITS,Pilani

0
1
0
0

22

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

RKTiwary
BITS,Pilani

0
1
0
0
0

23

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0

RKTiwary
BITS,Pilani

0
1
0
0
0
1

24

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0

RKTiwary
BITS,Pilani

0
1
0
0
0
1
1

25

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
RKTiwary
BITS,Pilani

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1
26

xyz= (w+w)xyz = 1101 + 0101 = m13 + m5

w

4/29/2016

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
RKTiwary
0 BITS,Pilani
0
0
0
1

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1

27

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
RKTiwary
BITS,Pilani

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1
28

Similarly
xyz = (w + w) xyz= m1 + m9
And wxy = wxy(z + z)= 0111 + 0110 = m7 + m6

4/29/2016

RKTiwary
BITS,Pilani

29

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
RKTiwary
BITS,Pilani

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1
30

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
RKTiwary
BITS,Pilani

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1
31

Then
wxy = ?
wxy= ?

4/29/2016

RKTiwary
BITS,Pilani

32

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
RKTiwary
BITS,Pilani

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1
33

x
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

4/29/2016

y
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

z
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

xy'z x'y'z w'xy wx'y wxy F

0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
1
RKTiwary
BITS,Pilani

0
1
0
0
0
1
1
1
0
1
1
1
0
1
1
1
34

T1: 2.19
Express the following function as a sum of minterms
and product of maxterms
F (A,B,C,D)= BD + AD + BD

4/29/2016

RKTiwary
BITS,Pilani

35

F (A,B,C,D)= BD + AD + BD
sol: BD + AD + BD = D(B +B) + AD

4/29/2016

RKTiwary
BITS,Pilani

36

F (A,B,C,D)= BD + AD + BD
sol: BD + AD + BD = D(B +B) + AD
= D + AD

4/29/2016

RKTiwary
BITS,Pilani

37

F (A,B,C,D)= BD + AD + BD
sol: BD + AD + BD = D(B +B) + AD
= D + AD
= D(1 + A)

4/29/2016

RKTiwary
BITS,Pilani

38

F (A,B,C,D)= BD + AD + BD
sol: BD + AD + BD = D(B +B) + AD
= D + AD
= D(1 + A)
= D

4/29/2016

RKTiwary
BITS,Pilani

39

B
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
4/29/2016

C
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

D
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1

F
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

min max
term term
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

F(A,B,C,D)=
(m1,m3,m5,m7,m9,m11,m13,
m15)
F(A,B,C,D)=
(m1,m3,m5,m7,m9,m11,m13,
m15)

RKTiwary
BITS,Pilani

40

F(A,B,C,D)= (m1m3 m5m7 m9m11 m13 ,m15)

F(A,B,C,D)= (m1 + m3 + m5+ m7+ m9+ m11+ m13
+m15)
= (0,2,4,6,8,10,12,14)

4/29/2016

RKTiwary
BITS,Pilani

41

F(A,B,C,D)= (m1m3 m5m7 m9m11 m13 ,m15)

F(A,B,C,D)= (m1 + m3 + m5+ m7+ m9+ m11+
m13 +m15)
= (0,2,4,6,8,10,12,14)
= m0 + m2 + m4+ m6+ m8+ m10+ m12+ m14

4/29/2016

RKTiwary
BITS,Pilani

42

F(A,B,C,D)= (m1m3 m5m7 m9m11 m13 ,m15)

F(A,B,C,D)= (m1 + m3 + m5+ m7+ m9+ m11+
m13 +m15)
= (0,2,4,6,8,10,12,14)
= m0 + m2 + m4+ m6+ m8+ m10+ m12+ m14
F(A,B,C,D)= (F(A,B,C,D))
= (m0 m2 m4 m6 m8 m10 m12
m14)
4/29/2016

RKTiwary
BITS,Pilani

43

F(A,B,C,D)= (m1m3 m5m7 m9m11 m13 ,m15)

F(A,B,C,D)= (m1 + m3 + m5+ m7+ m9+ m11+ m13
+m15)
= (0,2,4,6,8,10,12,14)
= m0 + m2 + m4+ m6+ m8+ m10+ m12+ m14
F(A,B,C,D)= (F(A,B,C,D))
= (m0 m2 m4 m6 m8 m10 m12
m14)
= M0 M2 M4 M6 M8 M10M12 M14
4/29/2016

RKTiwary
BITS,Pilani

44

F(A,B,C,D)= (m1m3 m5m7 m9m11 m13 ,m15)

F(A,B,C,D)= (m1 + m3 + m5+ m7+ m9+ m11+ m13
+m15)
= (0,2,4,6,8,10,12,14)
= m0 + m2 + m4+ m6+ m8+ m10+ m12+ m14
F(A,B,C,D)= (F(A,B,C,D))
= (m0 m2 m4 m6 m8 m10 m12
m14)
= M0 M2 M4 M6 M8 M10M12 M14
= (0,2,4,6,8,10,12,14)
4/29/2016

RKTiwary
BITS,Pilani

45

Canonical Form
A simpler and faster procedure for obtaining the
canonical sum-of-products
form of a switching function is summarized as
follows.
1. Examine each term; if it is a minterm, retain it,
and continue to the next term.
2. In each product that is not a minterm, check the
variables that do not occur; for each xi that does
not occur, multiply the product by (xi + xi ).
3. Multiply out all products and eliminate
redundant terms.
4/29/2016

RKTiwary
BITS,Pilani

46

Example Determine the canonical sumof-products form for T (x, y, z) = xy + z +

xyz. Applying rules 13, we obtain
T = xy + z+ xyz

4/29/2016

RKTiwary
BITS,Pilani

47

Example Determine the canonical sum-ofproducts form for T (x, y, z) = xy + z + xyz.

Applying rules 13, we obtain
T = xy + z+ xyz
= xy(z + z) + (x + x)(y + y)z + xyz

4/29/2016

RKTiwary
BITS,Pilani

48

Example Determine the canonical sum-ofproducts form for T (x, y, z) = xy + z + xyz.

Applying rules 13, we obtain
T = xy + z+ xyz
= xy(z + z) + (x + x)(y + y)z + xyz
= xyz + xyz+ xyz + xyz+xyz+ xyz+ xyz

4/29/2016

RKTiwary
BITS,Pilani

49

Example Determine the canonical sum-ofproducts form for T (x, y, z) = xy + z + xyz.

Applying rules 13, we obtain
T = xy + z+ xyz
= xy(z + z) + (x + x)(y + y)z + xyz
= xyz + xyz+ xyz + xyz+xyz+ xyz+ xyz
= xyz + xyz+ xyz+ xyz+ xyz + xyz.

4/29/2016

RKTiwary
BITS,Pilani

50

The canonical product-of-sums form is

obtained in a dual manner by expressing
the function as a product of factors and
adding the product xixi to each
factor in which the variable xi is missing.

4/29/2016

RKTiwary
BITS,Pilani

51

Example Let us determine the canonical

product-of-sums form of
T (x, y, z) = x(y+ z). Using the above
procedure
T (x, y, z) = x(y+ z).

4/29/2016

RKTiwary
BITS,Pilani

52

Example Let us determine the canonical

product-of-sums form of
T (x, y, z) = x(y+ z). Using the above
procedure
T (x, y, z) = x(y+ z).
= (x+ yy + zz)(y+ z + xx)
= [(x+ y + z)(x+ y + z)(x+y + z)(x+y+z)]
[(x + y + z)(x + y + z)]

4/29/2016

RKTiwary
BITS,Pilani

53

Example Let us determine the canonical

product-of-sums form of
T (x, y, z) = x(y+ z). Using the above
procedure
T (x, y, z) = x(y+ z).
= (x+ yy + zz)(y+ z + xx)
= [(x+ y + z)(x+ y + z)(x+y + z)(x+y+z)]
[(x + y + z)(x + y + z)]
= (x+ y + z)(x+ y + z)(x+ y+z) (x + y + z)
(x + y + z)
4/29/2016

RKTiwary
BITS,Pilani

54

Eg. A class room has an old clock on the wall

whose minute hand broke off
a. If you could the hour hand to the nearest
15 minutes , how many bits of information
does the clock convey?
b. If u know whether it is A.m. or P.m. , how
many additional bits of information do you
know about the time?

4/29/2016

RKTiwary
BITS,Pilani

55

(a) The hour hand can be resolved to

12 * 4 = 48 positions,
which represents
log248 = 5.58 bits of information.
(b) Knowing whether it is before or after
noon adds one more bit.

4/29/2016

RKTiwary
BITS,Pilani

56

Eg. An analog voltage is in the range of 0to5v.

If it can be measured with an accuracy of
50mv, at most how many bits of information
does it convey
Sol: An accuracy of 50 mV indicates that the
signal can be resolved to 100
mV intervals. There are 50 such intervals in
the range of 0-5 volts, so the signal
represents log250 = 5.64 bits of information.
4/29/2016

RKTiwary
BITS,Pilani

57

Example
Use NAND gates
and NOT gates to
implement
Z=EF(AB+C+D)+GH
AB
AB+C+D
EF(AB+C+D)
EF(AB+C+D)+GH

4/29/2016

RKTiwary
BITS,Pilani

PJF - 58

Yet Another Example!

4/29/2016

RKTiwary
BITS,Pilani

59