Karnaugh map: 4-variable example

A

C

D

0000

1111

1000

0111

B

1 0 0 1

0 1 0 0

1 1 1 1

1 1 1 1

AB

CD

A

B

D

00

01

11

10

00

01

11

10

find the smallest number of the largest possible subcubes to cover the ON-set

(fewer terms with fewer inputs per term)

C

• F(A,B,C,D) = ?m(0,2,3,5,6,7,8,10,11,14,15)F =

Previous slide

Next slide

Back to first slide

View graphic version