# Karnaugh map or K-map `discussion`.

2,3,4,5 variables K-map are ways of minimizing the Boolean functions using diagrams which are made up of squares. By minimization we imply a function with minimum number of terms and each term with lowest number of literals.

#### Following k-map for 2-5 variables are discussed in this section:

Two variable Karnaugh map (K-map) and 2 var kmap example discussed below.

First write the Truth Table for 2 variables x and y.

Once we know all the values in table its easier to plot the 2 var k-map.

LTE - 4G Wireless Technology

Digital fundamentals.

Interview Questions. 2 variable K– map plot below : - Each element (0-3) from above table is plotted in k-map below. Var x is horizontal row and y is vertical column.  There intersection denotes output function element. #### A solved example of 2 variable k-map below.

F(x,y)=sum(0,2,3) Tutorials `@fullchipdesign.com`

Verilog Tutorial.

LTE Tutorial.

Memory Tutorial.

Minimization solution to above function.

= y’(x + x’) + xy + xy’ = y’ + x (y+y’) = y’ + x

`K-map Trick`: From the elements in enclosed box, we can minimize by only keeping the element which are not changing. In this example its y’ and x.

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