Mapas de karnaugh
Taller Mapas de Karnaugh y funciones lógicas
Circuitos Digitales
Joan Camilo Marín Lopez
PARTE 1
1. F=|AB+|A|B+A|B
| |B | B |
|A | 1 | 1 |
A | 1 | 0 |
F=|B+|A
2. F=(|A+|B)(|A+B)(A+B)
| B | |B |
A | 0 | 1 |
|A | 0 | 0 |
F=|AB
3. F=AB+AC+A|B|C
| |B|C | |BC | BC | B|C |
|A | 0 | 0 | 0 | 0 |
A | 1 | 1| 1 | 1 |
F=A
4. F=B(A+|C)(|A+B+|C)
Solución 1
C | B | A | A+|C | |A+B+|C | F |
0 | 0 | 0 | 1 | 1 | 1 |
0 | 0 | 1 | 1 | 1 | 1 |
0 | 1 | 0 | 1 | 1 | 1 |
0 | 1 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 0 | 1 | 0 |
1 | 0 | 1 | 1 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 0 |
1 | 1 | 1 | 1 | 1 | 1 |
| |B|C | |BC | BC | B|C |
|A | 0 | 1 | 0 | 1 |
A | 1 | 0 | 1 | 1 |
F=(A+|C)(B+|C)Solución 2.
| A+B | A+|B | |B+|C | |A+B |
C | 0 | 1 | 1 | 0 |
|C | 0 | 0 | 1 | 0 |
F=B(A+|C)
5.
C\AB | 00 | 01 | 11 | 10 |
0 | 0 | 1 | 0 | 1 |
1 | 1 | 0 | 1 | 1 |
Maxtérminos
F=(A+B+C)(A+|B+|C)(|A+|B+C)
Mintérminos
F = (C|B)+(|AB|C)+(A|B)
6.
C\AB | 00 | 01 | 11 | 10 |
0 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 1 |
Maxtérminos
F=C (|A+|B)Mintérminos
F=AC+|BC
7.
A | B | C | F |
0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 0 |
| |B|C | |BC | BC | B|C |
|A | 1 | 0 | 0 | 0 |
A | 1 | 1 | 0 | 0 |
Por mintérminos:
F=A|B+|B|C
F=|B(A+|C)
8.
A | B | C | F |
0 | 0 | 0 | 1 |
0 | 0 | 1 | 1 |
0 | 1 | 0| 0 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 |
| |B|C | |BC | BC | B|C |
|A | 1 | 1 | 0 | 0 |
A | 1 | 1 | 1 | 1 |
Por mintérminos:
F=A+|B
9. F=(|A|B|C|D)+(|A|BCD)+(|A|BC|D)+(|AB|CD)+(AB|CD)+(ABC|D)+(A|B|CD)
| |C|D | |CD | CD | C|D |
|A|B | 1 | 0 | 1 | 1 |
|AB | 0 | 1 | 0 | 0 |
AB | 0 | 1 | 0 | 1 |
A|B | 0 | 1 | 0 | 0 |
F = (|D|A|B)+(C|A|B)+ (B|CD)+(A|CD)+(ABC|D)
10.
F = (|A|B|C|D)+(A|B|C|D)+(|A|B|CD)+(|AB|CD)+(AB|CD)+(|A|BCD)+(|A|BC|D)+(A|BC|D)
| |C|D | |CD | CD | C|D |
|A|B | 1 | 1 | 1 | 1 |
|AB | 0 | 1 | 0 | 0 |
AB | 0 | 1 | 0 | 0 |
A|B | 1 | 0 | 0 | 1 |
F = (|A|B)+ (|A|CD)+ (B|CD)+ (A|B|D)
11.
A | B | C | D | Y |
0 | 0 | 0 | 0 | 0 |
0 | 0 | 0 | 1 | 0 |
0 | 0| 1 | 0 | 1 |
0 | 0 | 1 | 1 | 1 |
0 | 1 | 0 | 0 | 1 |
0 | 1 | 0 | 1 | 1 |
0 | 1 | 1 | 0 | 0 |
0 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 0 | 0 |
1 | 0 | 0 | 1 | 0 |
1 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 |
1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 1 |
| |C|D | |CD | CD | C|D |
|A|B | 0 | 0 | 1 | 1 |
|AB | 1 | 1 | 1 | 0 |
AB | 0 | 0 | 0 |1 |
A|B | 0 | 0 | 1 | 1 |
F=|AB|C+|ABD+AC|D+|BC
PARTE 2
1. F=(ABC)+(A|BC)+(AB|C)+(|A|B|C)+(|AB)
| |B|C | |BC | BC | B|C |
|A | 1 | 0 | 1 | 1 |
A | 0 | 1 | 1 | 1 |
Por mintérminos:
F = (|A|C)+B+AC
2.
A | B | C | F |
0 | 0 | 0 | X |
0 | 0 | 1 | 1 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 1 |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | X | | |B|C | |BC | BC | B|C |
|A | X | 1 | 1 | 0 |
A | 0 | 1 | X | 0 |
F=C
3.
A | B | C | F |
0 | 0 | 0 | 1 |
0 | 0 | 1 | 1 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | X |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | X |
1 | 1 | 1 | 1 |
| |B|C | |BC | BC | B|C |
|A | 1 | 1 | X | 0 |
A | 0 | 1 | 1 | X |
F=(|A|B)+C
4. F=(A|D)+(B|D)
| |B|D | |BD | BD| B|D |
|A | 0 | 0 | 0 | 1 |
A | 1 | 0 | 0 | 1 |
F = (A|D)+ (B|D)
F = |D(A+B)
A | B | D | F |
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 1 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 |
1 | 1 | 0 | 1 |
1 | 1 | 1 | 0 |
5. F=(A+C)(A+|B)(|A+B+|D)
| C+D | C+|D | |C+|D | |C+D |
A+B | 0 | 0 | 1 | 1 |
A+|B | 0 | 0 | 0 | 0 |
|A+|B | 1 | 1 | 1 | 1 |...
Regístrate para leer el documento completo.