In the K map below, the input values abcd, ab cbar dbar, abar bc dbar, abar bbar

Question

In the K map below, the input values abcd, ab cbar dbar, abar bc dbar, abar bbar c dbar, and abar, bbar, cbar, d are assigned don't-care output values (ie..X). choose values for the don't-care outputs to minimize the number of product terms. abad = ab cbar dbar = abar bc dbar = abar bbar c dbar abar bbar cbar d = choose values for the don't-care outputs to minimize both the number of product terms and the number of literals. abcd = ab cbar dbar = abar bcd dbar = abar bbar c dbar = abar bbar c dbar = write a sum-of-products representation for the function that has the fewest number of both product terms and literals by utilizing the don't-care conditions.

Explanation / Answer

a)answer: minimum product terms would be 3 with following don't cares..

abcd(1111) =0

ab!c!d(1100) =0

!abc!d(0110) = 1

!a!bc!d(0010) =1

!a!b!cd(0001) =1

b)answer:

abcd(1111) =0

ab!c!d(1100) =0

!abc!d(0110) = 1

!a!bc!d(0010) =1

!a!b!cd(0001) =1

c)answer:

sum of products representation:-(minimized with dont cares)

!ac+!b!c+!b!d

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---