Question: Net ID. Problem 3 (6 pts): Consider a finite state machine (FSM) that recognizes the pattern 1101. The input to the FSM is a sequence
Net ID. Problem 3 (6 pts): Consider a finite state machine (FSM) that recognizes the pattern "1101". The input to the FSM is a sequence of binary bits, one after the other. When the FSM receives 1101 as inputs in successive bits, it should output 1. Otherwise, the output should be 0 For example Input sequence: 11011011001101 FSM output: 00010010000001 a. Draw the state diagram for this FSM (Name the states as SO, S1, S2 etc). b. How many flip flops are required to implement the circuit for this FSM? c. Draw the output truth table for this FSM. (Use the same name for states as you specified in the state diagram) d. Draw the next state logic truth table for this FSM. (Use the same name for states as you specified in the state diagram)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
