- An Fsm Finite State Machine With Input M Has The Function Described In The Following State Diagram And Is To Be Impl 1 (75.7 KiB) Viewed 35 times
- An Fsm Finite State Machine With Input M Has The Function Described In The Following State Diagram And Is To Be Impl 2 (52.79 KiB) Viewed 35 times
An FSM (finite state machine) with input "M" has the function described in the following state diagram and is to be implemented using two synchronously clocked T-Type flip-flops as the state registers. M=1 M=0 [00] [10] o M=O M=0 [11] M=1 State label [BA] M=0 a) Write down the corresponding state table taking into account all transitions in the state diagram, indicated by both solid and dashed lines. STATE-TABLE 1/P Current States Flip flop input values M B A TB ТА 0 0 0 Transition Table 0 0 1 1 0 T-FF 1 1 Q(t) Q(t+1) 0 1 0 1 1 0 1 0 1 0 1 0 0 0 1 1 1 1 [01] Next States В' A M=1 M=1 0 1 1 T 0 1 1 0
b) Using K-map, find the simplified Boolean expressions of TA and Te TA B'A' B'A BA ВА' B'A' To B'A M' M BA BA M' M TA = ? TB = ? c) Show, how the required FSM can be constructed by using the T-Type flip-flops. CLK LLLL ● Draw the circuit diagrams of the flip-flop's inputs TA and TB. TB FF1 10:20 A B A' B' K₁