Mapas De Karnaugh 4 Variables Ejemplos Resueltos May 2026

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.

So K-map:

[ F = B' D' + B D ]

[ F = \overlineA\ \overlineB + B C \overlineD + A \overlineB \overlineC + A \overlineB C D ] mapas de karnaugh 4 variables ejemplos resueltos

(Note: In a real solution, you'd plot carefully and find m11 can pair with m3? No, m3=0011, not adjacent.) Problem: Simplify ( F(A,B,C,D) = \sum m(0,2,5,8,10,15) + d(3,7,12,13) ) (d = don't care, can be 1 or 0 to help grouping) Step 1: Fill K-map (1 for minterms, X for don't cares) CD AB 00 01 11 10 00 1 0 X 1 (m0,m3?, m2) Actually m0=1, m1=0, m3=X, m2=1 01 0 1 1 X (m4=0, m5=1, m7=X, m6=0) 11 X X 1 0 (m12=X, m13=X, m15=1, m14=0) 10 1 0 0 1 (m8=1, m9=0, m11=0, m10=1) Correction for clarity: No, m3=0011, not adjacent

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. Better: Give function in SOP, then convert to POS

Better: Give function in SOP, then convert to POS.