Transistors,LogicGatesandKarnaughMaps-LaSalle.pptVIP

PHY 201 (Blum) * Improving Some combinations that differ only by a single bit are not in consecutive rows. Thus there may be a simplification associated with such a combination and we might miss it. So we put some of the inputs in as columns. PHY 201 (Blum) * Two rows that differ by one bit but are not consecutive A B C Out 0 0 0 0 0 0 1 0 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 1 0 1 0 1 0 0 0 PHY 201 (Blum) * A row-column version A B\C 0 1 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 Place the C inputs across the top. All inputs are filled in with light blue. In this version, more inputs differing by one bit only are in adjacent positions. This output corresponds to the input A=0, B=1 and C=0 PHY 201 (Blum) * Karnaugh-map This way of arranging truth tables combined with the rules for simplifying Boolean expressions goes by the name Karnaugh map or K map. Named for Maurice Karnaugh. PHY 201 (Blum) * Maurice Karnaugh PHY 201 (Blum) * The rules Put the truth table into a form with inputs in Gray code order. Then one identifies output “blocks” (as large as possible). A block must be a rectangle containing 1’s and only 1’s. The simplification rules require that the number of 1’s in a block should be a power of 2 (1, 2, 4, 8, …). However, a given output 1 can belong to more than one block. PHY 201 (Blum) * Wrapping There are still cases in which inputs differing by only one bit are not adjacent (e.g. the first and last row). Imagine that the rows wrap around, so for instance, a block can include the top and bottom rows (without intermediate rows). Similarly for columns. PHY 201 (Blum) * W X Y Z Output 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 0 1 0 1 0 1 1 0 1 1 0 1 0 1 1 1 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 0 1 0 1 1 0 1 1 0 0 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 Karnaugh Example PHY 201 (Blum) * Karnaugh Example (Unsimplified Boolean algebra expression) WXY’Z + W’XY’Z + WX’Y’Z’ + W’X’Y’Z’ + WXYZ’ + WXY’Z’ + W’XY’Z’ + W’XYZ’ PHY 201 (Blum) * Exampl