Simplification of Boolean Expressions

Doesnt guarantee simplest form of expression Terms are not obvious Skills of applying rules and laws

K-map provides a systematic method

An array of cells Used for simplifying 2, 3, 4 and 5 variable

expressions

AB\C

1 A\BC 00 0 01 1 11 3 10 2

00 01 11 10

0 2 6 4

1 3 7 5

AB\CD

00

01

11

10

00 01 11 10

0 4 12 8

1 5 13 9

3 7 15 11

2 6 14 10

K-map is considered to be wrapped around All sides are adjacent to each other Groups of 2, 4, 8,16 and 32 adjacent cells are formed Groups can be row, column, square or rectangular. Groups of diagonal cells are not allowed

Selecting n-variable K-map 1 marked in cell for each minterm Remaining cells marked with 0

SOP expression

ABC ABC ABC

AB\C 00 01 11

0 0 1 1

1 0 0 0 A\BC 00 01 11 10

0
1

0
1

0
0

0
0

1
1

10

SOP expression

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

AB\CD 00 01 11 10

00 01
11 10

0 1
0 1

1 1
1 0

0 0
0 0

0 1
1 0

Selecting n-variable K-map 1 marked in all the cells where the nonstandard product term is present Remaining cells marked with 0

SOP expression A BC

AB\C 00 01 11

A\BC 1 1

00

01

11

10

0
1 1 1 1 1

10

SOP expression A BC

AB\C 00 01 11

0 0 1 1

1 0 0 1 A\BC 00 01 11 10

0
1

0
1

0
1

0
1

1
1

10

SOP expression D AC BC
AB\CD 00 01 11 10 00 0 0 0 0 01 1 1 1 1 11 1 1 1 1 10 0 0 0 0

SOP expression D AC BC
AB\CD 00 01 11 10 00 0 0 1 1 01 1 1 1 1 11 1 1 1 1 10 0 0 0 0

SOP expression D AC BC
AB\CD 00 01 11 10 00 0 0 1 1 01 1 1 1 1 11 1 1 1 1 10 0 1 1 0

Mapping of expression Forming of Groups of 1s Each group represents product term 3-variable K-map

1 cell group yields a 3 variable product term

2 cell group yields a 2 variable product term

4 cell group yields a 1 variable product term 8 cell group yields a value of 1 for function

4-variable K-map
1 cell group yields a 4 variable product term 2 cell group yields a 3 variable product term 4 cell group yields a 2 variable product term 8 cell group yields a 1 variable product term 16 cell group yields a value of 1 for function

B.C A.C B.C

AB\C 00 01 11 10 0 0 1 1 0 1 1 0 1 1 00 0 1 01 1 0 11 1 0 10 1 0

A\BC
0 1

A.B.C A.C A.B

B A.C
AB\C 00 01 11 10 0 0 1 1 0 1 0 1 1 1 00 0 1 01 0 1 11 1 1 10 1 0

A\BC
0 1

A.B B.C A.B

A.C B.D B.C

AB\CD 00 01 11 10

00
01

0
0

1
0

1
1

0
1

11
10

1
1

1
1

1
1

1
0

A.C.D C.D B.C

AB\CD 00 01 11 10

00
01

0
0

0
0

1
1

0
1

11
10

1
1

0
0

1
1

1
0

B.D B.C A.B.D A.C.D

AB\CD 00 01 11 10

00
01

1
0

0
0

1
0

1
1

11
10

0
1

1
0

1
1

0
1

Function of a logic circuit defined by function table Function can be directly mapped to Kmap

Inputs A 0 0 0 0 0 0 0 0 B 0 0 0 0 1 1 1 1 C 0 0 1 1 0 0 1 1 D 0 1 0 1 0 1 0 1

Output F 0 1 0 1 0 1 0 1

Inputs A 1 1 1 1 1 B 0 0 0 0 1 C 0 0 1 1 0 D 0 1 0 1 0

Output F 0 0 0 1 0

1
1 1

1
1 1

0
1 1

1
0 1

1
0 0

A.D B.C.D B.C.D

AB\CD 00 01 00 0 0 01 1 1 11 1 1 10 0 0

11
10

0
0

1
0

0
1

0
0

Some input combinations never occur Outputs are assumed to be dont care Dont care outputs used as 0 or 1 during simplification. Results in simpler and shorter expressions

Inputs A 0 0 0 0 0 0 0 0 B 0 0 0 0 1 1 1 1 C 0 0 1 1 0 0 1 1 D 0 1 0 1 0 1 0 1

Output F 0 1 0 1 0 1 0 1

Inputs A 1 1 1 1 1 B 0 0 0 0 1 C 0 0 1 1 0 D 0 1 0 1 0

Output F 0 0 X X X

1
1 1

1
1 1

0
1 1

1
0 1

X
X X

A.D
AB\CD 00 01 00 0 0 01 1 1 11 1 1 10 0 0

11
10

x
0

x
0

x
x

x
x

D
AB\CD 00 01 00 0 0 01 1 1 11 1 1 10 0 0

11
10

x
0

x
x

x
x

x
x