Karnaugh Maps (2)

Another way to represent a logic function: a graphical representation. _ One map cell corresponds to a row in the  truth table.  One map cell corresponds to a minterm in the boolean expression; areas of map correspond to minterms, maxterm, product terms, etc

•Note ordering of variables, for f(x1,x2), x1 is the row, x2 is the column.

•Cell 0 represents x1’x2’; a 1 in that cell means that minterm is present in the function. (etc.)

 Any two adjacent cells in the map differ by only one variable, which is primed in one cell and unprimed in the other.

• Example:  f(x1,x2) = x1’x2’+ x1’x2 + x1x2’ = m0 + m1 + m2= x1’ + x2’

• Grouping (ORing) of 1s allows simplification
• What (simpler) function is represented by each dashed rectangle?

– x1’ = m0 + m1

– x2’ = m0 + m2

Note m0 covered twice