Reading
Assignment
In class we developed a truth table for the next state function of our day-of-week state machine:
| Present State | Next State | ||||
|---|---|---|---|---|---|
| S2 | S1 | S0 | S2 | S1 | S0 |
| 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 0 | 0 |
Study the Minimization Tutorial above, and then answer the following questions:
- Draw a logic network that implements the entire truth table using the unminimized sum of products implementation.
- Tell the gate input count for the unmimimized network.
- Determine the mimimized equations for the three functions using algebraic minimization. Show all work.
- Minimize the functions again using Karnaugh Maps. Be sure the results are the same as for algebraic mimization. Show all work.
- Draw the logic network that implements the minimized functions.
- Tell the gate input count for the minimized network.
- Is there any speed difference between the two implementations? If yes, how much?
- Optional: Change the output values for the
last row of the truth table to “don’t care”
values (X) and do the Karnaugh Map again.
What difference did it make?
Submit the Assignment
Write your name and your answers to the questions on a piece of paper and bring it to class on the due date. If you did the assignment with someone else, put both names on a single copy of the answers (rather than submitting the answers twice).
