Editing K-map (section)

=== Final notes ===
The whole idea is based on the fact that a circuit like this:

<code>
(SuperComplexExpression AND a) OR (SuperComplexExpression AND NOT a)
</code>

is the same as just

<code>
(SuperComplexExpression)
</code>

Because it doesn't matter if A is {{On}} or {{Off}} - either the first part of the bracket is passed through, or the second part. So if only one bit changes, then we can remove that bit from the equation. (I was asked about that fact in my exam, so maybe it is good to know).

----

You can do a Karnaugh map for 3 bits, by throwing away the two rows on the bottom and the D input.

----

You can also do a Karnaugh map for 5 bits, by creating two 4-bit maps. One where the 5th bit is {{Off}} and one where the 5th bit is {{On}}. Then imagine you lay both maps on top of each other, so you can do additional blocks by piercing through both maps.

----

The way we collected the bits and put together the blocks is called ''Disjunctive Normal Form (DNF)'' which focuses on the {{On}} output bits, which are then '''OR'''d together. There is also a ''Conjunctive Normal Form (CNF)'' where you focus on the {{Off}} bits and then '''AND''' the blocks together (a bit more complicated - you have to look it up).

----

If you have two potential blocks of {{On}} bits, but the intersection of those two blocks are {{Off}}, then you can '''XOR''' them together instead of '''OR'''.

[[File:KMap_Example10.png]]

----

If you have a ''chess board pattern'' in your KV map, you can just XOR all inputs together.