Question

Design a Mealy FSM that will model an elevator that can be at any of 4 floors of EPIC (Ground, First, Second, and Third). There are 2 input buttons that are active High – U to move UP and D to move DOWN. The input buttons are mutually exclusive, that is, only one of them can be active at any point in time (U = 0 and D = 1 makes it go DOWN, and U = 1 and D = 0 makes it go UP, any other combination does not change the state of the elevator, i.e. it stays at the same floor). There are two LEDs (outputs Y and Z) to indicate that the elevator has reached the Ground floor (Z is ON) or the Third floor (Y is ON). The LEDs will be OFF at all the other floors. Use the format UD if you choose to use just binary values for the transitions. Assign state names as S0.....Sn (ranging from Ground to Third, respectively) and encode the states using the minimum required number of binary digits corresponding to the index of each state. If any binary state encodings are not used, set the next state to Reset and output to zero. Use active-high logic to indicate an input or output is active. Show the state transition diagram, state assignments, state transition table, next-state equations, and output equations. Use K-maps to extract the most simplified equations.

Answer 1

ANSWER :
u state 50,5,152 153 To design a mealy Machine we are taking respeckvely for ground, first second and thid floor There are two inputs up and two output connected to LED for Ground 2 for third floory. i is used for high inputs The state transition diagram as follow The state transition table 0010 Von 09/00 0/0 10%0 10/0 So S 3 ol 01100 IN 이 Ol 10 10 00 uolyz 33 001% As not mentioned the condition when UD=01 state so Ground floor and UD = 10 at state 53 at third floor we take it as it remains at sake state in these conditions

as we have ustate state assignment state, we require a bits bits for 4 states [224 50.-00, 3,701, 52 =10, 59 = 1 1 1 00 = 2.9, as follows: state transition table as follows. Inputs present state output Next state out at Qo y 2, D 0 0 0 0 0 - D 0 0 0 O o 0 - 0 0 1 0 - 0 1 0 0 0 0 0 1 - 0 OO o 1 0 0 1 0 0 0 0 0 0 0 - 0 1 0 1 0 0 - O - -- - 1 0 1 Х Х Х Х Х x x Х X 1 X X X x x X х X x x 1 X Х X

Qoq da qai no ai C' O - 부 11 - o o 0 1 OD o 0 - UD 0 1x UD x Х Х X Х UD 0 VÕ - 1 1 uo - for at = ūña, tua, ta tua Qt=. JDQ, + U0 tuat Doa, 7.0 8 9.9, 0, uo 11 IX 11 for at ad, for output UD U ūD .00 UDO 07 for y= uq+00D so, Neatstate equations Qot cao, + D + UQ; +UQ + Doa doo Too, oa aan Qorao oa doa UĎ 0 O c ÜD 1 1 oo UD Х X IX Х UD X x X X 1 с UD 0 o 0 for 2= Dao tu da 1 and output equations are Y = ulo at 9 QD za Dão todo a