Please fill the black missing parts of (a) state diagram, (b) state table, (c) encoded state table, (d) logic equations Specifications: 1. Your combination lock will use on-off push button switches. When the switches are all off, the input is a zero; if switch #1 is on K1=1, switch #2 = K2=1, etc. The combination to be detected will be K1 K3 K2 2. When you type in the correct combination, the LED should be activated. 3. Your design should be based on a finite state machine (FSM), and should have at least 4 states. 4. There should be some initial start state which we will label A, with subsequent states being, B, C, etc. Note: In the tables below, A=s0 s1 = 0 0, B=01, C=11, and D=10. This is different from typical examples given in class. Remember that the assignment of these states is arbitrary. This assignment was done to simplify the K-maps. If you are curious, try it with C = 1 0 and D=11. 5. Use another switch as a "reset" such that when pressed, causes the FSM to go to the start state. 6. If during the input sequence a wrong number is inputted, the machine should go to the start state. 7. Once a valid combination is received, and the light is activated it would stay on if switch K2=l or the input is zero. Otherwise, if switches K1 = 1, K3= 1 or the reset switch is activated, it should return to the start state. For example, on the McAllister Hall combinational door mechanisms, once you turn the doorknob, the internal electronics are reset so you are able to re-enter a new combination sequence. 8. Presumably, in between each of the number inputs, the input is a 0. The 0 input is the case when all the switches are off. A 0 input should not cause a change of state. no erkast kool vast ..... 2-1 les CA--1, 33 . ! K1 - ILL011 ti Hu Trail 20-000-00 400-000-00 03 -1000- (+0000000 Ramana Ma s am neem 0000000- QO00-1000 Joo-oooo Yoooooooo noooo CoocCOM loosolarenesssolo ka tez. 1ooo oolollolo 110 !! 101 166 zosos, kike Frostik +sosikika 10 1011 o col OH Olullo !!! for loo Kalo lou oor all ol ulo !! lol 100 Please fill the black missing parts of (a) state diagram, (b) state table, (c) encoded state table, (d) logic equations Specifications: 1. Your combination lock will use on-off push button switches. When the switches are all off, the input is a zero; if switch #1 is on K1=1, switch #2 = K2=1, etc. The combination to be detected will be K1 K3 K2 2. When you type in the correct combination, the LED should be activated. 3. Your design should be based on a finite state machine (FSM), and should have at least 4 states. 4. There should be some initial start state which we will label A, with subsequent states being, B, C, etc. Note: In the tables below, A=s0 s1 = 0 0, B=01, C=11, and D=10. This is different from typical examples given in class. Remember that the assignment of these states is arbitrary. This assignment was done to simplify the K-maps. If you are curious, try it with C = 1 0 and D=11. 5. Use another switch as a "reset" such that when pressed, causes the FSM to go to the start state. 6. If during the input sequence a wrong number is inputted, the machine should go to the start state. 7. Once a valid combination is received, and the light is activated it would stay on if switch K2=l or the input is zero. Otherwise, if switches K1 = 1, K3= 1 or the reset switch is activated, it should return to the start state. For example, on the McAllister Hall combinational door mechanisms, once you turn the doorknob, the internal electronics are reset so you are able to re-enter a new combination sequence. 8. Presumably, in between each of the number inputs, the input is a 0. The 0 input is the case when all the switches are off. A 0 input should not cause a change of state. no erkast kool vast ..... 2-1 les CA--1, 33 . ! K1 - ILL011 ti Hu Trail 20-000-00 400-000-00 03 -1000- (+0000000 Ramana Ma s am neem 0000000- QO00-1000 Joo-oooo Yoooooooo noooo CoocCOM loosolarenesssolo ka tez. 1ooo oolollolo 110 !! 101 166 zosos, kike Frostik +sosikika 10 1011 o col OH Olullo !!! for loo Kalo lou oor all ol ulo !! lol 100
