loader image

Mapas De Karnaugh 4 Variables Ejemplos Resueltos (2026)

Given ( F = \sum m(3,5,11,15) ), find POS. CD AB 00 01 11 10 00 0 0 1 0 (m3=1) 01 0 1 0 0 (m5=1) 11 0 0 1 0 (m15=1) 10 0 0 1 0 (m11=1) Wait, m11=1011, yes at AB=10, CD=11 =1. m15=1111 at AB=11,CD=11=1.

[ F = B' D' + B D ]

Thus minimal SOP: m3+m11 = B C D, m5 alone = A' B C' D, m15 alone = A B C D. But that's not minimal. Let's stop here — the point is grouping 1s. mapas de karnaugh 4 variables ejemplos resueltos

Thus minimal SOP:

Actually m5=0101 at AB=01,CD=01=1. m3=0011 at AB=00,CD=11=1. Zeros are all except those four 1s. Instead of grouping zeros, simply find minimal SOP from 1s: Given ( F = \sum m(3,5,11,15) ), find POS

[ F = \overlineA\ \overlineB + B C \overlineD + A \overlineB \overlineC + A \overlineB C D ] [ F = B' D' + B D