Escolar Documentos
Profissional Documentos
Cultura Documentos
Aula MapasKarnaugh
Aula MapasKarnaugh
Mapas de Karnaugh
Prof. Luciano C. A. Pimenta
Prof. Ricardo de Oliveira Duarte
Sistemas Digitais
DELT - UFMG
aula 3
0
1
Mapas K de 3 variveis
AB
C
0
1
0 1
0 2
1 3
A
00 01 11 10
0
1
2
3
6
7
AB
CD 00 01 11
00 0 4 12
01 1 5 13
11 3 7 15
C
10 2 6 14
4
5
10
8
9
D
11
10
B
3
00 1
01 0
11 1
C
10 1
0 1
1
1
1
0 0
1 1
1 1
B
1 0 0
1 0 1
1 1 0
1 1 1
F(A,B,C,D)=C + ABD + BD
O Objetivo da minimizao usando Mapas K gerar
o menor agrupamento de 1s, grupando todos os
5 1s
existentes no mapa.
aula 3
AB
A
A
AB
A
AB
CD
00 01 11 10 CD 00 01 11 10 CD 00 01 11 10
00 1 0 0 0
00 0 0 0 0
00 0 1 1 1
01 0 1
11 0 0
10 0 0
0 0
1
0
D 01 1
11 1
C
0
1
0
0
1
0
10 1 1
01 0
11 0
C
10 0
0
1
0
0
F(A,B,C,D)=ABCD
G(A,B,C,D)=ABD +
H(A,B,C,D)=AC
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
BCD + AC
+ ABD + BCD
aula 3
F(A,B,C,D)=AD + CD
00 0
01 1
11 1
0 X 0
1 X 1
10 0
aula 3
Exemplo:BCD incrementado de 1
00 01 11 10
00 0 0 X 1
01 0 0 X 0
AB
11 0 1
10 0 0
CD
Y
C
AB
X X
X X
B
11 1 0
10 0 1
00 0 0 X 0
01 1 1 X 0
D
11 0 0 X X
X X
B
00 01 11 10
00 0 1 X 0
01 0 1 X 0
00 01 11 10
10 1 1
CD
X
CD
Z
C
aula 3
AB
W
0
0
0
0
0
0
0
1
1
0
X
X
X
X
X
X
X
0
0
0
1
1
1
1
0
0
0
X
X
X
X
X
X
Y
0
1
1
0
0
1
1
0
0
0
X
X
X
X
X
X
Z
1
0
1
0
1
0
1
0
1
0
X
X
X
X
X
X
Exemplo:BCD incrementado de 1
A
AB
CD
00 01 11 10
CD
D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
AB
B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
X 1
X 0
D
X X
10 1 1
X X
B
C
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
D
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
W
0
0
0
0
0
0
0
1
1
0
X
X
X
X
X
X
X
0
0
0
1
1
1
1
0
0
0
X
X
X
X
X
X
Y
0
1
1
0
0
1
1
0
0
0
X
X
X
X
X
X
Z
1
0
1
0
1
0
1
0
1
0
X
X
X
X
X
X
aula 3
10
00 01 11 10
00 1 1
01 0 0
11 0 0
B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
X X
X X
B
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
11
Aplicao do algoritmo
F(A,B,C,D)=m(4,5,6,8,9,10,13) + d(0,7,15)
AB
AB
00 01 11 10
00 X 1 0 1
01 0 1 1 1
AB
00 01 11 10
00 X 1 0 1
01 0 1 1 1
CD
11 0 X X 0
C
10 0 1 0 1
11 0 X
C
10 0 1
00 01 11 10
00 0 4 12 8
A=0 01
1 5 13 9
11 3 7 15 11
10 2 6 14 10
aula 3
15
Mapas K de 6 vriaveis
CD
CD
00 01 11
10
0
4 12
8
1 5
13
9
3
7 15 11
10
2
6 14 10
CD
EF
00 01 11
10
00 16
20 28 24
01
AB = 01
17 21 29 25
11 19 23 31
27
EF
10
AB = 10
50 54
CD
EF
00
00 32
62
58
01
36
11
44
01
33 37 45 41
11 35
39 47 43
10 34 38 46 42
10
AB = 01
10
AB = 11
10
1
CD
EF
00
00
01
11
11
01
11
1
1
CD
00 01 11
EF
00
01
1
1
11
10
10
1
10
01
11
AB = 10
10
1
CD
EF
00
00
10
40
aula 3
01
00
01
11
AB= 00
10
AB = 11
18 22 30 26
CD
00 01 11
10
EF
00 48 52 60
56
01
49 53 61 57
11
51 55 63
59
00
EF
00
01
11
01
1
14
11
DE
BC
00
A=0 01
11
10 1
00 01 11 10
1
1 1
1
1
1
BC
BC 00 01 11 10
00 01 11 10
DE
00
1
00 16 20 28 24
A=1 01
17 21 29 25 A=1 01 1 1 1
11 1 1 1
11 19 23 31 27
10
10 18 22 30 26
DE
AB= 00
aula 3
DE
00 01 11 10
00 X 1 0 1
01 0 1 1 1
D
11 0 X X 0
C
10 0 1 0 1
11 0 X X 0
10 0 1 0 1
Mapas K de 5 vriaveis
CD
11 0 X X 0
10 0 1 0 1
BC
AB
00 01 11 10
00 X 1 0 1
01 0 1 1 1
F(A,B,C,D)=m(2,5,7,8,10,13,15,17,19,21,23,24,29,31)
0
1
13
00 01 11 10
00 X 1 0 1
01 0 1 1 1
CD
11 0 X X
10 0 1 0
CD
AB
X 0
0 1
aula 3
AB
00 01 11 10
00 X 1 0 1
01 0 1 1 1
CD
CD
10
1
1
17
aula 3
16