Scribd
Upload
189 views

Answers Homework3 PDF

The document provides examples of optimizing Boolean functions by finding their prime and essential prime implicants. It gives the prime and essential implicants for several Boolean functions and shows how to simplify the functions using AND, OR, NOT, NAND, and NOR gates. It also includes examples with don't care conditions and shows how to account for these in the optimization.

Uploaded by

rrtilak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
189 views

Answers Homework3 PDF

The document provides examples of optimizing Boolean functions by finding their prime and essential prime implicants. It gives the prime and essential implicants for several Boolean functions and shows how to simplify the functions using AND, OR, NOT, NAND, and NOR gates. It also includes examples with don't care conditions and shows how to account for these in the optimization.

Uploaded by

rrtilak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Answers Homework 3

1) Optimise the following Boolean functions by finding all the prime implicants
and essential prime implicants and applying the selection rule. After you have
optimized the functions, implement it using the corresponding logic gates.

a) F(W,X,Y,Z) = m(0,1,4,5,7,8,9,12,14,15)
(draw it with AND,OR, NOT gates)

b) F(W,X,Y,Z) = m(1,5,6,7,11,12,13,15)
(draw it with NAND gates)

c) F(W,X,Y,Z) = m(0,2,3,4,5,7,8,10,11,12,13,15)
(draw it with NOR gates)

For convenience I will show the prime and essential implicants. In the tables the
prime implicants are drawn in blue and the essential ones in red. (of course all
essential prime implicants are also prime implicants). The simplified functions
do not have to be unique! (but have to be minimal)

a)

Y
YZ
WX
1 1

1 1 1
X
1 1 1
W
1 1

Our prime implicants are:


WY, WXZ, XYZ, YZ, XY, WXY, WXZ

Our essential prime implicants are:


XY
Our simplified function is:
F(W,X,Y,Z) = YZ + XY + WXY + WXZ
W X Y Z

F
b)

Y
YZ
WX
1

1 1 1
X
1 1 1
W
1

Our prime implicants are:


ZX, WYZ, WXY, WYZ, WXY

Our essential prime implicants are:


WYZ, WXY, WYZ, WXY

Our simplified function is:


F(W,X,Y,Z) = WYZ + WXY + WYZ + WXY

Now we convert to NAND:


F = ((WYZ + WXY + WYZ + WXY))
= ((WYZ)(WXY)(WYZ)(WXY))

W X Y Z

F
c)

Y
YZ
WX
1 1 1

1 1 1
X
1 1 1
W
1 1 1

Our prime implicants are:


XZ, XY, YZ, YZ, XZ, XY
None of the prime implicants is essential!!!

The resulting simplified function is


F(WXYZ) = YZ + XZ + YX

Now we convert to NOR:


F = ((YZ)) + ((XZ)) + ((YX))
= (Y + Z) + (X + Z) + (Y + X)
= (((Y + Z) + (X + Z) + (Y + X) ))

W X Y Z

F
2) The same as task 1, only now we also have dont care conditions d.

a) F(A,B,C,D) = m(0,3,5,7,11,13), d(A,B,C,D) = m(4,6,14,15)


(AND,OR,NOT)

b) F(A,B,C,D) = m(0,6,8,13,14), d(A,B,C,D) = m(2,4,7,10,12)


(NAND)

c) F(A,B,C,D) = m(0,1,2,4,5), d(A,B,C,D) = m(3,6,7)


(NOR)

a)
C
CD
AB
1 1

X 1 1
1 X
1 B
1 X X
1
A
1

Our prime implicants are:


CD, BD, AB, ACD

Our essential prime implicants are:


CD, BD, ACD

Our simplified function is:


F(A,B,C,D) = CD + BD + ACD
A B C D

b)

C
CD
AB
1 X

X X 1
B
X 1 1
A
1 X

Our (essential) prime implicants are:


D, ABC

Our simplified function is:


F(A,B,C,D) = D + ABC

Now convert to NAND:


F = ((D + ABC))
= (D(ABC))
A B C D

c)

C
CD
AB
1 1 X 1

X 1 X X
B

Our (essential) prime implicants is


A

Our simplified function is


F(A,B,C,D) = A

Now convert to NOR (you dont have to do anything actually)


F = (A + A)

You might also like