# Digital Electronics/Lecture Karnaugh Map Reductions

* EE111 Edit/View
* Electronic Engineering
* EE Digital Electronics
* Lecture, Number systems and logic states
* Lecture, Digital Logic Gates
* Lecture, Combinatorial Functions
* Lecture, Karnaugh Map Reductions
* Lecture, Arithmetic
* Lecture, Flip-flops
* Mid-term Exam
* Lecture, Sequential Logic
* Lecture, Memory Elements
* Lecture, Registers and Counters
* Lecture, Advanced Sequential Circuits
* Lecture, Logic Simulation
* Lecture, High Level Language Logic Modelling and Synthesis
* Final Exam
The Karnaugh map, also known as a Veitch diagram (K-map or KV-map for short), is a tool to facilitate management of Boolean algebraic expressions. A Karnaugh map is unique in that only one variable changes value between squares, in other words, the rows and columns are ordered according to the principles of Gray code.

## History and nomenclature

The Karnaugh map was invented in 1953 by Maurice Karnaugh, a telecommunications engineer at Bell Labs.

## Usage in boolean logic

Normally, extensive calculations are required to obtain the minimal expression of a Boolean function, but one can use a Karnaugh map instead.
Problem solving uses
* Karnaugh maps make use of the human brain's excellent pattern-matching capability to decide which terms should be combined to get the simplest expression.
* K-maps permit the rapid identification and elimination of potential race hazards, something that boolean equations alone cannot do.
* A Karnaugh map is an excellent aid for simplification of up to six variables, but with more variables it becomes hard even for our brain to discern optimal patterns.
* For problems involving more than six variables, solving the boolean expressions is more preferred than the Karnaugh map.
Karnaugh maps also help teach about Boolean functions and minimization.

## Properties

A Karnaugh map may have any number of variables, but usually works best when there are only a few - between 2 and 6 for example. Each variable contributes two possibilities to each possibility of every other variable in the system. Karnaugh maps are organized so that all the possibilities of the system are arranged in a grid form and between two adjacent boxes only one variable can change value. This is what allows it to reduce hazards.
When using a Karnaugh map to derive a minimized function, one "covers" the ones on the map by rectangular "coverings" that contain a number of boxes equal to a power of 2 (for example, 4 boxes in a line, 4 boxes in a square, 8 boxes in a rectangle, etc). All of the ones must be covered and a covering cannot have a zero in it. Once a person has covered the ones, a term of a sum of products is produced by finding the variables that do not change throughout the entire covering, and taking a 1 to mean that variable and a 0 as the complement of that variable. Doing this for every covering gives you a matching function.
One can also use zeros to derive a minimized function. The procedure is identical to the procedure for ones except that each term is a term in a product of sums - and a 1 means the complement of the variable while 0 means the variable non-complemented.
Each square in a Karnaugh map corresponds to a minterm (and maxterm). The picture to the right shows the location of each minterm on the map.

## Size of map

In a Karnaugh map with $n$ variables, a Boolean term mentioning $k$ of them will have a corresponding rectangle of area $2^{n-k}$. Common sized maps are of 2 variables which is a 2x2 map; 3 variables which is a 2x4 map; and 4 variables which is a 4x4 map (shown below).
* 2 variable map
* 3 variable map
* 4 variable map

## Example

Consider the following function of four variables (which, in binary, has a maximum number of combinations of 16):
    $f(A,B,C,D)=E(6,8,9,10,11,12,13,14)$
The values inside $E$ lists the minterms to map (i.e., which rows have output 1 in the truth table).

### Truth table

Using the defined minterms, the truth table can be created:
| # | $A$ | $B$ | $C$ | $D$ | $f(A,B,C,D)$ |
| 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 2 | 0 | 0 | 1 | 0 | 0 |
| 3 | 0 | 0 | 1 | 1 | 0 |
| 4 | 0 | 1 | 0 | 0 | 0 |
| 5 | 0 | 1 | 0 | 1 | 0 |
| 6 | 0 | 1 | 1 | 0 | 1 |
| 7 | 0 | 1 | 1 | 1 | 0 |
| 8 | 1 | 0 | 0 | 0 | 1 |
| 9 | 1 | 0 | 0 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 1 |
| 11 | 1 | 0 | 1 | 1 | 1 |
| 12 | 1 | 1 | 0 | 0 | 1 |
| 13 | 1 | 1 | 0 | 1 | 1 |
| 14 | 1 | 1 | 1 | 0 | 1 |
| 15 | 1 | 1 | 1 | 1 | 0 |

### Map

The input variables can be combined in 16 different ways, so our Karnaugh map has to have 16 positions. The most convenient way to arrange this is in a 4x4 grid.
The binary digits in the map represent the function's output for any given combination of inputs. We write 0 in the upper leftmost corner of the map because $f=0$ when $A=0$, $B=0$, $C=0$, $D=0$. Similarly we mark the bottom right corner as 1 because $A=1$, $B=0$, $C=1$, $D=0$ gives $f=1$. Note that the values are ordered in a Gray code, so that precisely one variable flips between any pair of adjacent cells.
After the Karnaugh map has been constructed our next task is to find the minimal terms to use in the final expression. These terms are found by encircling groups of 1's in the map. The encirclings must be rectangular and must have an area that is a power of two (i.e. 1, 2, 4, 8, …). The rectangles should be as large as possible without containing any 0's. The optimal encirclings in this map are marked by the green, red and blue lines.
For each of these encirclings we find those variables that have the same state in each of the fields in the encircling. For the first encircling (the red one) we find that:
* The variable $A$ maintains the same state (1) in the whole encircling, therefore it should be included in the term for the red encircling.
* Variable $B$ does not maintain the same state (it shifts from 1 to 0), and should therefore be excluded.
* $C$ does not change: it is always 0.
* $D$ changes.
Thus the first term in the Boolean expression is $A{\overline {C}}$.
For the green encircling we see that $A$ and $B$ maintain the same state, but $C$ and $D$ change. $B$ is 0 and has to be negated before it can be included. Thus the second term is $A{\overline {B}}$.
In the same way, the blue rectangle gives the term $BC{\overline {D}}$ and so the whole expression is: $A{\overline {C}}+A{\overline {B}}+BC{\overline {D}}$.

### Toroidally connected

The grid is toroidally connected, which means that the rectangles can wrap around edges, so $A{\overline {D}}$ is a valid term, although not part of the minimal set — this covers minterms 8, 10, 12, & 14.
Perhaps the hardest-to-visualize wrap-around term is ${\overline {B}}\,{\overline {D}}$ which covers the four corners — this covers minterms 0, 2, 8, 10.

### Inverse

The inverse of a function is solved in the same way by encircling the 0's instead.
The three terms to cover the inverse are all shown with grey boxes with different colored borders:
* brown — ${\overline {A}}\,{\overline {B}}$
* gold — ${\overline {A}}\,{\overline {C}}$
* blue — $BCD$
This yields the inverse:
    ${\overline {F}}={\overline {A}}\,{\overline {B}}+{\overline {A}}\,{\overline {C}}+BCD$
Through the use of De Morgan's laws, the product of sums can be determined:
    ${\overline {\overline {F}}}={\overline {{\overline {A}}\,{\overline {B}}+{\overline {A}}\,{\overline {C}}+BCD}}$
    $F=\left(A+B\right)\left(A+C\right)\left({\overline {B}}+{\overline {C}}+{\overline {D}}\right)$

### Don't cares

Karnaugh maps also allow easy minimizations of functions whose truth tables include "don't care" conditions (that is sets of inputs for which the designer doesn't care what the output is) because "don't care" conditions can be included in a ring to make it larger but do not have to be ringed. They are usually indicated on the map with a hyphen/dash/X in place of the number. The value can be a "0," "1," or the hyphen/dash/X depending on if one can use the "0" or "1" to simplify the KM more. If the "don't cares" don't help you simplify the KM more, then use the hyphen/dash/X.
The example to the right is the same above example but with minterm 15 dropped and replaced as a don't care. This allows the red term to expand all the way down and, thus, removes the green term completely. This does impact the blue inverse term and must be restricted by ${\overline {A}}$.
This yields the new minimum equation:
    $F=A+BC{\overline {D}}.$
Note that the first term is just $A$ not $A{\overline {C}}$. In this case, the don't care has dropped a term (the green); simplified another (the red); and removed the race hazard (the yellow as shown in a following section).

## Race hazards

Karnaugh maps are useful for detecting and eliminating race hazards. They are very easy to spot using a Karnaugh map, because a race condition may exist when moving between any pair of adjacent, but disjointed, regions circled on the map.
* In the above example, a potential race condition exists when C is 1 and D is 0, A is 1, and B changes from 1 to 0 (moving from the blue state to the green state). For this case, the output is defined to remain unchanged at 1, but because this transition is not covered by a specific term in the equation, a potential for a glitch (a momentary transition of the output to 0) exists.
* A harder possible glitch to spot is when D is 0 and A and B are both 1, with C changing from 1 to 0 (moving from the blue state to the red state). In this case the glitch wraps around from the top of the map to the bottom.
Whether these glitches do occur depends on the physical nature of the implementation, and whether we need to worry about it depends on the application.
In this case, an additional term of $A{\overline {D}}$ would eliminate the potential race hazard, bridging between the green and blue output states or blue and red output states: this is shown as the yellow region.
The term is redundant in terms of the static logic of the system, but such redundant, or consensus terms, are often needed to assure race-free dynamic performance.

## 2 variable maps

The following are all the possible 2 variable, 2x2 Karnaugh maps. Listed with each is the minterms as a function of $E$ and the race hazard free (see previous section) minimum equation.
* E; K=0
* E(1); K=A'B'
* E(2); K=AB'
* E(3); K=A'B
* E(4); K=AB
* E(1,2); K=B'
* E(1,3); K=A'
* E(1,4); K=A'B' + AB
* E(2,3); K=AB' + A'B
* E(2,4); K=A
* E(3,4); K=B
* E(1,2,3); K=A' + B'
* E(1,2,4); K=A + B'
* E(1,3,4); K=A' + B
* E(2,3,4); K=A + B
* E(1,2,3,4); K=1

## Problems with Karnaugh maps

Karnaugh maps generally become more cluttered and hard to interpret when adding more variables. A general rule is that Karnaugh maps work well for up to four variables, and shouldn't be used at all for more than six variables. For expressions with larger numbers of variables, the Quine-McCluskey algorithm can be used. Nowadays in general the minimization process is carried out by computer, for which the Espresso heuristic logic minimizer has become the standard minimization program.