Question: Table Q4(a) shows the flow table for an asynchronous sequential finite state machine (FSM). z is the output and we and wi are the inputs.


Table Q4(a) shows the flow table for an asynchronous sequential finite state machine (FSM). z is the output and we and wi are the inputs. Derive the reduced Moore-type flow table by drawing merger diagram. (12 marks) Next state Present state Output 00 01 10 11 A A B C B D B H 1 0 C F --- H D D E C E A E H F F C 1 H B H 1 Table Q4(a) (b) Table Q4(b) shows the excitation table for an asynchronous sequential finite state machine (FSM). I is the output and r and s are the input. Present State Next State (Y,Y) Output (yzyi) 00 01 10 11 TS=00 11 11 11 01 10 00 11 10 01 (10 01 00 01 Table Q4(b) 10 OD (10 10 0 1 1 0 In Table Q4(b), there are some problematic transitions due to race condition in Y2 and Y1. Identify all problematic transitions. For each problematic transition, specify the present state and the changes in input that give rise to the problematic next state. (8 marks) (ii) Give the hazard-free minimum cost Boolean expressions in sum-of- products (SOP) form for the next states Y2
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
