Question
Suppose we have a machine that takes in an infinite stream of bits, one bit at a time. On every input, the machine will output
Suppose we have a machine that takes in an infinite stream of bits, one bit at a time. On every input, the machine will output '0', unless the machine has seen the pattern '10101' in the last five inputs where it will instead output '1'. Below is an example of this behavior.
Input: 010101001110110101011...
Output: 000001000000000001000...
3.1 Design a circuit that exhibits the behavior described above, use D-Flip-Flops for memory, and use a one hot encoding design for the state registers. You can also use decoders, encoders, multiplexors, and gates discussed in class. (20 Points)
3.2 Design a circuit that exhibits the behavior described above, use D-Flip-Flops for memory, and use an encoded state (i.e., fewer flip-flops) design for the state registers. You can also use decoders, encoders, multiplexors, and gates discussed in class. (20 Points)
this is the only description we have.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started