1. Karnaugh Mapping, or K-Mapping is another way to derive a simplified logic expression.
2. To make a K-Map, you must create a table of every possible input and their corresponding outputs as shown below. (Not that the second set or rows and columns are flipped)
3. Then, group output 1s together. By seeing what inputs correspond to the groups, you can derive a simplified logic expression.
4. K-Mapping works best on complex sets of inputs with few positive outputs, on simpler expressions boolean algebra is faster.
2. To make a K-Map, you must create a table of every possible input and their corresponding outputs as shown below. (Not that the second set or rows and columns are flipped)
3. Then, group output 1s together. By seeing what inputs correspond to the groups, you can derive a simplified logic expression.
4. K-Mapping works best on complex sets of inputs with few positive outputs, on simpler expressions boolean algebra is faster.