Canonical Form

- Boolean Expression expressed in

sum of minterms or product of maxterms

Standard form
F1 = y +xy + xyz
F = (AB + CD)(AB+CD)

KARNAUGH MAPS
-Graphical

Device used to
Simplify Boolean expressions

-Relates
-Useful

inputs to Outputs

upto six variables

Row of a Truth Table corresponds

to a square in K-map

Adjacent square differ in only one variable

Combine squares with 1s

00

01

11

10

00

01

11

10

0
1
0
1

00

01

11

10

00

01

11

10

0
1

00
0
1

01

11

10

00

01

11

10

00

01

11

10

0
1

0
1

00
0
1

01

11

10

00

01

11

10

00

01

11

10

0
1

0
1

00

0
1

01

11

10

00

01

11

10

00

01

11

10

00

01

11

10

00

01

11

10

00

01

11

00

10

01

11

10

00

01

11

10

00

01

11

10

00 01 11 10

00 01 11 10

Dont Care Conditions

- Unspecified outputs for certain inputs
- Used in Map to provide further
simplification
- X is marked inside the square for dont
care input

- Choose to include each dont care

minterm with either 1 or 0

POS Simplification
- Combine valid adjacent squares
containing 0s
- Obtain simplified expression of the
complement in SOP form
- Compliment further to get function
in POS form

F(A,B,C,D) = (0,1,2,5,8,9,10)

F(A,B,C,D) = (0,1,2,5,8,9,10)

F = AB + CD + BD
By De Morgans
F = (A+B) (C+D)(B+D)