Question

Using K-map Technique simplify the following Boolean function F, together with the don’t care condition function d:
(,, , ) = ∑(, , , , ) (,, , ) = ∑, , , , ,

Can anyone solve it please​

Answer 1

Example-1:

Minimise the following function in SOP minimal form using K-Maps:

f = m(1, 5, 6, 11, 12, 13, 14) + d(4)

Explanation:

The SOP K-map for the given expression is:

Therefore, SOP minimal is,

f = BC' + BCD' + A'C'D + AB'CD

Example-2:

Minimise the following function in POS minimal form using K-Maps:

F(A, B, C, D) = m(0, 1, 2, 3, 4, 5) + d(10, 11, 12, 13, 14, 15)

Explanation:

Writing the given expression in POS form:

F(A, B, C, D) = M(6, 7, 8, 9) + d(12, 13, 14, 15)

The POS K-map for the given expression is:

Therefore, POS minimal is,

F = (A'+ C)(B' + C')

Example-3:

Minimise the following function in SOP minimal form using K-Maps:

F(A, B, C, D) = m(1, 2, 6, 7, 8, 13, 14, 15) + d(0, 3, 5, 12)