If a drawing of a finite state machine solution for this problem is submitted by class on Wednesday, 25&September; this assignment may be submitted to the Moodle submission page for Homework 5 by 1:00 PM on Saturday, 28 September.
Problem 1 and only
Implement a sequential circuit with one input and one output
that produces 1 as output if and only
if the last three input bits were, in sequence, 1 0 1.
Be careful of overlapping sequences of 1 0 1.
For example, the input sequence
0 1 1 0 1 0 1 1 0 0 1 0 1 0
should result in the output sequence
0 0 0 0 1 0 1 0 0 0 0 0 1 0
You will find it easiest to create the combinational part of the circuit using Logisim’s Analyse Circuit tool. Do this by creating an empty circuit with three inputs and three outputs and then type in the appropriate table giving the state transistions. After that you can cut-and-paste the circuit into something similar to the Nabs implementation.
If your solution has more than four possible states, you are making the problem too hard.
The solution that you turn in should be the circ file generated by Logisim. Be sure to label your inputs and outputs clearly. It would be nice if you could include your last name in the submitted file name.