Step 1. Understand what the problem specification is telling you.

We take the numbers to be a shorthand way of representing four (4) bits: ABCD. Thus we have 0 = 0000 = ABCD 4 = 0100 = ABCD and so on. When mapped to a Karnaugh map, the cell assignments look like this:

The given function can be filled in on the Karnaugh map like this:

Step 2. Write the function f(A,B,C,D) in Disjunctive Normal Form. Disjunctive Normal Form is another way of saying a sum of products. This process involves identifying the largest rectangles on the Karnaugh map that will cover the cells of interest and writing their corresponding logic terms. Here is one rectangle:

1 of 3

We can see that the AB values take on all possibilities for this rectangle, so they are don't care. On the other hand, the rectangle is defined by CD = 00. Thus, this group of cells can be covered by the term CD. The remaining cells can be covered by another rectangle defined by two of the inputs. This is what it looks like:

Here, we see that B and D are don't care inputs, as they assume all possible values. This group of cells is covered by the term that has A=1 and C=0, that is, AC. We have found the function to be (in DNF) f(A,B,C,D) = CD + AC Step 3. Show a NAND gate implementation. We know a 2-level NAND gate circuit provides the logical equivalent of AND-OR logic. This (ANDOR) form is what we have. We only need to come up with C and D, which is easily done using NAND gates.

2 of 3

The result is shown here:

3 of 3