{~ Karnaugh Map Method efKarnaugh Map Technique e K-Maps, like truth tables, are a way to show the relationship between logic inputs and desired outputs. e K-Maps are a graphical technique used to simplify a logic equation. e K-Maps are very procedural and much cleaner than Boolean simplification. e K-Maps can be used for any number of input variables, BUT are only practical for fewer than six. wtK-Map Format e Each minterm in a truth table corresponds to a cell in the K-Map. e K-Map cells are labeled so that both horizontal and vertical movement differ only in one variable. e Once a K-Map is filled (0’s & 1’s) the sum-of- products expression for the function can be obtained by OR-ing together the cells that contain 1’s. e Since the adjacent cells differ by only one variable, they can be grouped to create simples terms in the sum-of-product expression. lead thewayf Truth Table -TO- K-Map xX Y mintemos |0 O minterm 10 041 minterm 2 10 minterm 3) 1 1Lf 2 Variable K-Map : Groups of One xX Xx X xX ¥Gbe xy Yio Gi xy Yo 0 Y| 0] 0 x 4 x xX Yi olo Y) 0] 0 y Ghat xy Y o (GI x vyAdjacent Cells 4 xX Y x x Y YGroupings e Grouping a pair of adjacent 1’s eliminates the variable that appears in complemented and uncomplemented form. e Grouping a quad of 1’s eliminates the two variables that appear in both complemented and uncomplemented form. e Grouping an octet of 1’s eliminates the three variables that appear in both complemented and uncomplemented form, etc..... ? thewaya 2 Variable K-Map : Groups of Two Xx Xx x X Y| 0} 0 ER xX <| \) < <| x| x< x< <| <| ° ° <| ° % ifft 2 Variable K-Map : Group of Four YO GE ie4 Two Variable Design Example R S| T RR me Lo 0 1/0 5 — 10/4 50.0 1 1/0 ! T= Fes =S4 3 Variable K-Map : Vertical ABC|Y AA minteemon | 0 O O| 1 BC 1 0 minteemt | 0 O 1] 0 _ ° . minterm20 | 0 1 0} 1 BC) 0 , 0 5 minterm3n | QO 1 1/4 1 minterm 40] 1 0 0] 0 BC) 1 ‘ 0 a minterm50 | 1 0 1] 0 BC 1 1 minterm6o | 1 #1 OO] 1 2 8 minterm70 | 1 31 1) 0 ief 3 Variable K-Map : Horizontal minterm 00 minterm 11 minterm 21) minterm 3 () minterm 41) minterm 5) minterm 61 minterm 7 () A BC/Y 0 0 0; 1 001)0 0 1 0)1 o141)41 1 0 0/0 1 01)0 1 1 0; 1 1 11/0 Ol °}: Variable K-Map : Groups of Two AB AB AB AB Soo ° felfe][e][e] BeLf 3 Variable K-Map : Groups of Four ie4 3 Variable K-Map : Group of Eight ieSimplification Process Construct the K-Map and place 1’s in cells corresponding to the 1’s in the truth table. Place 0’s in the other cells. Examine the map for adjacent 1’s and group those 1’s which are NOT adjacent to any others. These are called isolated 1’s. Group any hex. Group any octet, even if it contains some 1’s already grouped, but are not enclosed in a hex. Group any quad, even if it contains some 1’s already grouped, but are not enclosed in a hex or octet. Group any pair, even if it contains some 1's already grouped, but are not enclosed in a hex, octet or quad. Group any single cells remaining. g Form the OR sum of all the terms grouped. leadThree Variable Design Example #1 1 J K LIM 000 0 0 0| 0 1Three Variable Design Example #2 A 0 0 0 0 1 1 1 1 - +2 00++ 0 0/0 -Oo-7A +000 =|N Ol 4 ° °o [=] =o}, 0 020A 0 0 0 0 1 1 1 1 Three Variable Design Example #3 - +2 00++ 0 0/0 = ofA 424200 4 Fp = F. ro Ow] ol Ow] oO ol BC B AC >| °Four Variable K-Map wxy zr mintermo 1/0 000/14 — _ mintem1 5/00 0 1/0 WX WX WX WX mintem2 2/00 1 0] 0 _ minterm3 0/0 0 1 140 YZ\ 1 1 0 i minterm4o|0 100] 4 ° 4 12 a minterm5 1|9 1 0 1 | 4 = minteem6 1/9 1 10] 0 YZ OF 1 ; 1 1 , mintem7 0|g 11 1 | 4 minterm8s}4 0001 Yz!| 0 1 1 0 minterm 9 1001/1 a 5 ae “i minterm 105/49 1 0 | 9 mintermtto}4 0 1 4 | 0 YZ 0 0 1 0 minterm120/1 1 0 0 | 0 2 6 4 10 minterm 130/11 0 1 | 1 minterm14}1 4 1 0] 1 minterm 151/11 14 1 | 1 ieLf Four Variable K-Map : Groups of FourX WX WX WX Four Variable Design Example #1 XY Ww IN a €#2 YZ YZ 2 ied @ > E |x o =? x * S)— N Lu x oo] = + Ox [oto IN = -i|l- > nie | x| x 2 o =< 7 = i Q = [-l}eo |x x = 2 3 2 IN NN IN we io I> [> > > " o i > _ = °o LL Wx Y Z/Fe2 oooo © 2 2 e —