Beruflich Dokumente
Kultur Dokumente
4/4/16
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/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
4/4/16
RKTiwary
BITS,Pilani
10
4/4/16
RKTiwary
BITS,Pilani
11
4/4/16
RKTiwary
BITS,Pilani
12
4/4/16
RKTiwary
BITS,Pilani
13
4/4/16
RKTiwary
BITS,Pilani
14
4/4/16
RKTiwary
BITS,Pilani
15
4/4/16
RKTiwary
BITS,Pilani
16
4/4/16
RKTiwary
BITS,Pilani
17
4/4/16
RKTiwary
BITS,Pilani
18
4/4/16
RKTiwary
BITS,Pilani
19
4/4/16
RKTiwary
BITS,Pilani
20
4/4/16
RKTiwary
BITS,Pilani
21
4/4/16
RKTiwary
BITS,Pilani
22
4/4/16
RKTiwary
BITS,Pilani
23
4/4/16
RKTiwary
BITS,Pilani
24
4/4/16
RKTiwary
BITS,Pilani
25
4/4/16
RKTiwary
BITS,Pilani
26
4/4/16
RKTiwary
BITS,Pilani
27
4/4/16
RKTiwary
BITS,Pilani
28
Similarly
xyz = (w + w) xyz= m1 + m9
And wxy = wxy(z + z)= 0111 + 0110 =
m7 + m 6
4/4/16
RKTiwary
BITS,Pilani
29
4/4/16
RKTiwary
BITS,Pilani
30
4/4/16
RKTiwary
BITS,Pilani
31
Then
wxy = ?
wxy= ?
4/4/16
RKTiwary
BITS,Pilani
32
4/4/16
RKTiwary
BITS,Pilani
33
4/4/16
RKTiwary
BITS,Pilani
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/4/16
RKTiwary
BITS,Pilani
35
F (A,B,C,D)= BD + AD + BD
sol: BD + AD + BD = D(B +B)
+ AD
4/4/16
RKTiwary
BITS,Pilani
36
F (A,B,C,D)= BD + AD + BD
sol: BD + AD + BD = D(B +B)
+ AD
= D+
AD
4/4/16
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/4/16
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/4/16
RKTiwary
BITS,Pilani
39
F(A,B,C,D)=
(m1,m3,m5,m7,m9,m11,m
13,
m15)
F(A,B,C,D)=
(m1,m3,m5,m7,m9,m11,m
13,
m15)
4/4/16
RKTiwary
BITS,Pilani
40
4/4/16
RKTiwary
BITS,Pilani
41
4/4/16
RKTiwary
BITS,Pilani
42
RKTiwary
BITS,Pilani
43
RKTiwary
BITS,Pilani
44
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/4/16
RKTiwary
BITS,Pilani
46
4/4/16
RKTiwary
BITS,Pilani
47
4/4/16
RKTiwary
BITS,Pilani
48
RKTiwary
BITS,Pilani
49
RKTiwary
BITS,Pilani
50
RKTiwary
BITS,Pilani
51
4/4/16
RKTiwary
BITS,Pilani
52
RKTiwary
BITS,Pilani
53
RKTiwary
BITS,Pilani
54
RKTiwary
BITS,Pilani
55
RKTiwary
BITS,Pilani
56
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/4/16
RKTiwary
BITS,Pilani
PJF - 58
4/4/16
RKTiwary
BITS,Pilani
59