K-Map A K-Map is a pictorial representation of the Boolean expression. By entering the values of the minterm or Maxterm an SOP or POS equation can be very easily simplified. It is very easy tool for simplifying up to 5-variable Boolean equation, but as the variable increases, solution become tedious. To begin, we will learn how to draw a 2, 3 and 4 variable K-Map. Draw 2-Variable K-Map Draw 3-Variable K-Map Draw 4-Variable K-Map Simplification Using K-Map Simplifying 2-Variable SOP equation Ex-1: Simplifying F= A'B + AB Ex-2: Simplify A'B + AB + AB' Simplifying 3-Variable SOP equation Ex-3: Ex-4 Simplifying 4-Variable SOP Equation Ex-5 Simplify F(ABCD)=∑(m1, m3, m5, m7, m9, m10,m13, m15) Ans: D Practice Problem: Simplify F= A'B'+A'B+AB' Simplify F(WXY)=∑m(1,2,3,5,7) Simplify F(ABC)=∑m(2,3,4,5 ) Simplify F(ABC)=∑m(2,3,7) + d(1,5) Simplify F(ABCD)=∑m(2,3,5,7,10,15)+d(0, 4,9,13)

# Tag: Karnaugh Map

# Introduction to Karnaugh-Map

Karnaugh Map (K-map) K-Map is a pictorial representation of the Boolean function. It is a systematic method of simplifying the Boolean expression. A K-Map is an arrangement of the adjacent cell , each cell representing the minterm or the maxterm of the SOP or the POS equations. The number of adjacent cells in a K-Map depends on the number of input variables in an equation. The number of cell equals 2N where N is the number of input variables. Let us see how the minterm or the maxterms of the SOP or POS equations are represented. Two variable K-Map Table in figure-1 on the left is a truth table for two input variables. The output is shown in column marked ‘F’. m0, m1, m2,