757 views
0 votes
0 votes
It might be silly thing, but I am confused here,

In K-Map minimization, suppose there are don't care terms. When we want to get minimal SOP, we assume don't care to be 1 and will get the switching expression. Suppose for the same function we want to get POS and don't care terms which are assumed to be 1, will not be used.(Is my understanding correct). We can also choose same don't care terms which are used to get SOP.

What happens if don't care terms are assumed separately for SOP and POS. Don't care terms which are used to get SOP are not used to get POS and vice-versa.

2 Answers

0 votes
0 votes
If there is profit in taking the don't care,then take it,otherwise no need to take.
0 votes
0 votes
A function is said to be completely specified if it is given (0 or 1) for every combination of input variables. There exist some function which is not completely specified. Combinations for which value of the function is not specified are called Don't Care.

So from all this I mean, it can take o or 1 value at a time. So whenever u have to find minimal SOP then take don't care as 1 and when u have to find minimal POS then take Don't care as 0.

Related questions

1 votes
1 votes
2 answers
1
iarnav asked May 25, 2018
934 views
What is the minimal $Sum-Of-Products$ of the map? ($X$ is a don't care)
0 votes
0 votes
1 answer
2
Verma Ashish asked Aug 19, 2018
1,047 views
"once you have assumed a don't care as '1' u can't use the same don't care for grouping zeros and vice versa."is it correct or not??