Você está na página 1de 16

# Mapa de Karnaugh para duas variveis

A
regio A

regio A

A
B

A
regio B

regio B

B

A
regiao A B

regiao A B

regio posio
A B
0
A B
1
A B
2
A B
3
caso/posio
B
A

A
regiao A B

B
A

0
2

B
1
3

regiao A B

B
A
pos
0
1
2
3

A
0
0
1
1

B
0
1
0
1

S
0
1
0
1

0
2

B
A
A

0
0

1
3

B
1
1

S = AB +AB
pos
0
1
2
3

A
0
0
1
1

B
0
1
0
1

S
0
1
0
1

B
A
A

0
0

B
1
1

S=B

Mapa de
Karnaugh para
trs Variveis

A
C

C
B

C
B

C
B

B
A

A
C

C
B

C
B

C
B

C
B

regio
A
A
A
A
A
A
A
A

B
B
B
B
B
B
B
B

C
C
C
C
C
C
C
C

posio
0
1
2
3
4
5
6
7

B
A
A

0
4
C

B
1
5

3
7
C

2
6
C

B
A
pos.
0
1
2
3
4
5
6
7

A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

S
1
1
1
0
0
0
0
1

0
4

B
1
5

3
7
C

B
A
A

1
0
C

2
6

B
1
0

0
1
C

1
0
C

## Mapa de Karnaugh para trs Variveis: ex.: 1

S = /A /B /C + /A /B C + /A B /C + A B C
pos.
0
1
2
3
4
5
6
7

A
0
0
0
0
1
1
1
1

B
0
0
1
1
0
0
1
1

C
0
1
0
1
0
1
0
1

S
1
1
1
0
0
0
0
1

B
A
A

1
0
C

B
1
0

0
1
C

1
0
C

S = /A /B + /A /C + A B C

regio
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D
A B C D

posio
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

C
A
A

0 1 3 2 B
4 5 7 6
B
12 13 15 14
8 9 11 10 B
D
D
D

pos.
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

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

S
0
1
0
1
0
1
0
1
0
0
1
0
0
0
1
0

C
A
A

0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
D

A
A

B
B

C
0
0
0
0

C
1
1
0
0

1
1
0
0
D

0
0
1
1
D

B
B
B

## Karnaugh para quatro Variveis: ex.:1

pos.
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

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

S
0
1
0
1
0
1
0
1
0
0
0
1
0
1
0
0

S = /A /B /C D + /A /B C D + /A B /C D
+ /A B C D + A /B C D + A B /C D
C
A
A

0
0
0
0
D

C
1
1
0
0

1
1
0
0
D

0
0
1
1

B
B
B

S = /A D + A C /D

pos.
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

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

S
1
0
1
0
0
1
1
0
1
0
0
1
0
1
0
0

C
A
A

0 1 3 2
4 5 7 6
12 13 15 14
8 9 11 10
D

A
A

B
B

C
1
0
0
1

C
0
1
1
0

0
0
0
1
D

1
1
0
0
D

B
B
B

## Karnaugh para quatro Variveis: ex.: 2

pos.
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

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

S
1
0
1
0
0
1
1
0
1
0
0
1
0
1
0
0

S = /A /B /C /D + /A /B C /D +
/A B /C D + /A B C /D +
A /B /C /D + A /B C D + A B /C D
C
A
A

1
0
0
1
D

C
0
1
1
0

0
0
0
1
D

1
1
0
0
D

S = B /C D + /A C /D +
/B /C /D + A /B C D

B
B
B

Condies Irrelevantes
Durante a fase de construo da Tabela Verdade, referente a
um projeto, pode-se constatar eventuais faltas de especificao
em relao ao nvel lgico que uma sada deva assumir ao
acontece para a combinao S = AB , do exemplo abaixo:
pos A B S
B
B
B
B
0 0 0 x
A
A
0
1
x 0
1 0 1 0
2 3
1 1
2 1 0 1
A
A
3 1 1 1
x = condio irrelevante
(dont care)

0
1

## Atribua '0' ou '1' a 'x' de modo

a se obter a melhor expresso
booleana possvel.

fazendo x = '0':
S=A
fazendo x = '1':
S = A + /B

pos.
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

B
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1

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

## Condies Irrelevantes: ex.1:

S
0
0
C
C
1
1
0 0 1 1 B
A
1
1 1 0 1
1
B
x x x x
1
A
1 1 x x B
0
1
D
D
D
1
x
x
S = A + /B C + B /C + C /D
x
x
x
x

B
A

1
0

B
A

0
1

A
A

1
0

0
1

1
0

A
A

C
A

B
0
1

simplificao

1
0

1
0
1
0

0
1

0
1

B
1
0

0
1
C

C
0
1
0
1

1
0
1
0
D

1
0
C

C
0
1
0
1
D

B
A
B

0
1
0
1
D

C
1
0
1
0

0
1
0
1
D

1
0
1
0
D

B
B
B