This assignment must be submitted as a single file named yourlastname.circ for Assignment 2 of the CSCI 255 section on UNCA moodle by 11:00 PM on Wednesday, 28 October.
There probably will be an Assignment 3 due before Assignment 2.
Implement the state machine specified in the following two tables.
| presentstate | input | nextstate | ||
|---|---|---|---|---|
| P1 | P0 | I | N1 | N0 |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 1 | 0 | 1 |
| state | output | |
|---|---|---|
| P1 | P0 | O |
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
That should look familar. This assignment is an extension of Assignment 1. In fact, the next state table is the same table used for the combinational circuit of Assignment 1. So you should be able to reuse much of your solution from Assignment 1.
So what do you have to add? First, you need to add a couple of D flip-flops to store the state. Second, you need to add another combinational circuit to compute the output. However, it looks like all you'll need there is a single AND-gate computing P1 P0.
The completed circuit should produce a 1 on its output only if the three previous inputs were the sequence 110.