Mapas de Karnaugh
Mapas de Karnaugh
Mapas de Karnaugh
Sistemas Digitales TI
Ing. Pablo Molina
Maurice Karnaugh
Ingeniero de Telecomunicaciones
• AT&T Bell.
• 1953 Inventa el mapa-K o mapa de Karnaugh.
• Minimización de funciones por inspección visual.
Un diagrama o
mapa de Karnaugh
es una tabla de
verdad dispuesta
de
manera adecuada
para determinar
por
inspección la
expresión mínima
de suma de
productos de una
función lógica.
A’B’ AB’
m A B S A’B AB
0 0 0 A
m0 m2
1 0 1
m1 m3
B
2 1 0 AB’
A
B 0 1
3 1 1 0 0 2
1 3
1
Ing. Pablo Molina
Kmap para 2 variables
F1 (A,B) = A’ B’ + A B’ + AB
1 1
0 1
Ing. Pablo Molina
Como resolver Kmap para 2 variables
F1 (A,B) = A’ B’ + A B’ + A B
1
0
F1(A,B)= A + B’
Ing. Pablo Molina
Kmap para 3 variables
Con 3 Variables se
tienen8 términos
AB AB
C 00 01 11 10 C 00 01 11 10
0 A’B’C’ A’BC’ ABC’ AB’C’ 0 0 2 6 4
1
A’B’C A’BC ABC AB’C
1 1 3 7 5
AB AB
C 00 01 11 10 C 00 01 11 10
0 A’B’C’ A’BC’ ABC’ AB’C’ 0 0 2 6 4
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
A´ B C’
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
A B´ C´
1 1
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
A B C´
1 1 1
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
ABC
1 1 1
1
Ing. Pablo Molina
Kmap para 4 variables
Con 4 Variables se
tienen16términos
10 2 6 14 10
10 A’B’CD’ A’BCD’ ABCD’ AB’CD’
Con 5 Variables se
tienen32términos
16 1s mapas de 5 variables
8 1s mapas de 4 variables
4 1s mapas de 3 variables
=A
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B
1 1
1 1 1
1
Ing. Pablo Molina
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ +
1 1
0 1 1 1
1
Ing. Pablo Molina
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ +
1 1 1
1
Ing. Pablo Molina
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ +
1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ +
1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ +
1 1
1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ + A
1 1
1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ + A
0 1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ + A C’
0 1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ + A C´ +
1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ + A C´ +
11
1 1 1
1
Ing. Pablo Molina
Kmap para 3 variables
F (A, B, C) = A´ B C’ + A B´ C´ + A B C’ + A B C
F (A, B, C) = B C’ + A C´ + A B
11
1 1 1
1
Ing. Pablo Molina
Ejemplos del Kmap
m X Y F
0 0 0 1 F 0
1 0 1 1
2 1 0 0
3 1 1 1
1
F (X, Y)= X’ + Y
Ing. Pablo Molina
ejemplos del Kmap
F2(X, Y, Z) =Σm(1, 2, 5, 7)
0 1 0 0
1 0 1 1
1
1 1
0 10 1
0 1
0
F2(X, Y, Z) = X Z +
Ing. Pablo Molina
F2(X, Y, Z) =Σm(1, 2, 5, 7)
0
0
1 0
1 10 0
1 0
1
F2(X, Y, Z) = X Z + Y’ Z
Ing. Pablo Molina
F2(X, Y, Z) =Σm(1, 2, 5, 7)
01
0 0 1 0 0
1 0 1 1
F2(X, Y, Z) = X Z + Y’ Z + X’ Y Z’
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
0 1 0 0
0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
FX(A, B, C, D) = A’ B
0 1 0 0
01 0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
FX(A, B, C, D) = A’ B
0 0 1 0 0
0 0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
FX(A, B, C, D) = A’ B C’
0 1 0 0
0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
FX(A, B, C, D) = A’ B C’ + A C’D
0 1 0 0
01 0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
FX(A, B, C, D) = A’ B C’ + A C’D
0 1 0 0
01 0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
FX(A, B, C, D) = A’ B C’ + A C’D+ A’
0 0
0 1 0 0
0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
0 1 0 0
0 1 1 1
11 1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
11
0 1 0 0
0 1 1 1
1 1 1 0
0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) =Σm(3, 4, 5, 7, 9, 13, 14, 15)
0 1 0 0
0 1 1 1
1 1 1 1 0
1 0 0 1 0
Ing. Pablo Molina
FX(A, B, C, D) = A’ B C’ + A C’D+ A’CD+ABC
0 1 0 0
1.- Formar el menor
0 1 1 1 número de grupos
0 0 1 0
Ing. Pablo Molina
F3(A, B, C, D) =Σm(0,2,5,6,7,8,12,14)
1 0 0 1
0 1 0 0
1 1 1 1
1 1 1 1
Ing. Pablo Molina
F9 (A,B,C,D ) = Πm ( 2, 5, 7, 13, 15)
0 1 1 1
Ing. Pablo Molina
F9 = Πm ( 2, 5, 7, 13, 15)
(A,B,C,D )
0 1 1 1
Ing. Pablo Molina
F10 ( X,Y,Z,W ) = Σm ( 4,7,9,10,12,13,14,15)
X,
F11
X Y’ Y
1
1
Z, W
1
1
Ing. Pablo Molina
F11 (X, Y, Z, W ) = X Y’ + X Y W’ + X’ Y’ W + X’ Y’ Z’ W’
X,
F11
X Y W’ Y
1 1
1
Z, W
1
1 1
Ing. Pablo Molina
F11 (X, Y, Z, W ) = X Y’ + X Y W’ + X’ Y’ W + X’ Y’ Z’ W’
X,
F11
X’ Y’ W Y
1 1
1 1
Z, W
1 1
1 1
Ing. Pablo Molina
F11 (X, Y, Z, W ) = X Y’ + X Y W’ + X’ Y’ W + X’ Y’ Z’ W’
X’ Y’ Z’ W’ X,
F11
Y
1 1 1
1 1
Z, W
1 1
1 1
Ing. Pablo Molina
F11 (X, Y, Z, W ) = X Y’ + X Y W’ + X’ Y’ W + X’ Y’ Z’ W’
X,
F11
Y
1 1 1
1 1
Z, W
1 1
1 1
Ing. Pablo Molina
F11 (X, Y, Z, W ) = X Y’ + X Y W’ + X’ Y’ W + X’ Y’ Z’ W’
X, Y
F11
1 0 1 1
1 0 0 1
Z, W
1 0 0 1
0 0 1 1
Ing. Pablo Molina
F11 (X, Y, Z, W ) = X Y’ + X Y W’ + X’ Y’ W + X’ Y’ Z’ W’
X,
F11
Y
1 1 1
1 1
Z, W
1 1
1 1
Ing. Pablo Molina
X,Y
F12 ( X,Y,Z,W ) = Σm ( 1, 3, 6, 7, 9, 11, 12)
F12
1 1
Z,W
1 1 1
F12
0 0 1 0
1 0 0 1
Z,W
1 1 0 1
0 1 0 0
Ing. Pablo Molina
F13 (A,B,C,D) = Σm (3,5,6,7, 9,10,11,12,13,14)
F13
1 0 0 1
1 1 1 0
1 1 0 1
1 0 0 1
Ing. Pablo Molina