Mapas De Karnaugh 4 Variables Ejemplos Resueltos May 2026

So K-map:

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: mapas de karnaugh 4 variables ejemplos resueltos

For POS, you’d group zeros, but that’s another example. | Group Size | Variables Eliminated | Example (4-var) | |------------|----------------------|------------------| | 1 cell | 0 | A'B'C'D' | | 2 cells | 1 | A'B'C' (D gone) | | 4 cells | 2 | A'B' (C,D gone) | | 8 cells | 3 | A' (B,C,D gone) | | 16 cells | 4 (all) → 1 or 0 | Always 1 | 8. Conclusion 4-variable Karnaugh maps provide a visual, error-resistant method for minimizing logic functions up to 4 inputs. By correctly grouping adjacent 1s (or 0s) and using don't-care conditions, one can achieve the simplest SOP or POS form, reducing gate count in digital circuits. So K-map: Actually m5=0101 at AB=01,CD=01=1

Let's list: m0(0000)=1, m2(0010)=1, m5(0101)=1, m8(1000)=1, m10(1010)=1, m15(1111)=1. Don't cares: m3(0011)=X, m7(0111)=X, m12(1100)=X, m13(1101)=X. Instead of grouping zeros, simply find minimal SOP

Thus minimal SOP:

Thus the simplified expression is correct as above.