# 3 variable K-map, Example -3

#### Minimize following

Above is a **common** format of representing the K-**3 var** K– map with 1 and 0 values assigned to cells.

Above is a **common** format of representing the K-**3 var** K– map with 1 and 0 values assigned to cells.

The K-

Any adjacent 1, 2, 4 or 8 cells can be grouped to find a minimized logic value.

Following plot will show grouping of adjacent cells.

The two step minimization equation is shown below.

With reference to the table above the cells under the dotted box’s can be combined to come up with following reduced equation.

F = (x’yz+ xyz) + (xyz’ + xy’z’)

F = (yz + xz’) ... Final Answer.

More practice examples on 3 var kmap `completely`

**solved** at following links.

1. F(x,y,z) = (0,1,6,7) -

2. F(x,y,z) = (0,1,4,5,6,7) -

3. F(x,y,z) = (3,4,6,7) -

4. F(x,y,z) = (0,1,2,3,4,5,6,7) -

Various kmap `topics`

on fullchipdesign are listed below.

Link to 2 variables k-map.

Link to 3 variables k-map.

Link to 4 variables k-map.

Link to 5 variables k-map.

Link to Prime Implicant and Gate level minimization examples.

Hope you liked! this page. Don't forgot to access relevant `previous and next sections `

with links below.