1. Design a 5-bit combination lock. The lock has 3 buttons: (i) a reset button for...

Transcribed Image Text:

1. Design a 5-bit combination lock. The lock has 3 buttons: (i) a reset button for taking the lock in the initial state, (ii) a ‘0' button for entering a zero, and (iii) a '1' button to enter a one. It has one output light that is in the off state while the lock is engaged and in the on state when the lock is open. The lock opens when input sequence is 10011. If an wrong subsequence, for example 101, is entered the lock returns to the initial state. Design a Mealy Machine to solve this problem. Use the following variables: • Inputs: - R: to reset the lock to the INITIAL STATE. Z: for a zero input I: for a one input • Outputs: L: 0 off, and 1 = on. • You do not need to include invalid transitions, if any. • Recall that you need to complete 7 steps shown below. = (a) Draw a State Transition Diagram for the Mealy Machine (outputs on the arcs). (b) Create a State Transition Table from the State Transition Diagram. (c) Find binary representations of the states. (d) Rewrite the State Transition Table showing binary representations. (e) Write Boolean functions for the next states and outputs. (f) Minimize the Boolean functions. (g) Implement the Finite State Machine using combinatorial circuits and memory ele- ments. 1. Design a 5-bit combination lock. The lock has 3 buttons: (i) a reset button for taking the lock in the initial state, (ii) a ‘0' button for entering a zero, and (iii) a '1' button to enter a one. It has one output light that is in the off state while the lock is engaged and in the on state when the lock is open. The lock opens when input sequence is 10011. If an wrong subsequence, for example 101, is entered the lock returns to the initial state. Design a Mealy Machine to solve this problem. Use the following variables: • Inputs: - R: to reset the lock to the INITIAL STATE. Z: for a zero input I: for a one input • Outputs: L: 0 off, and 1 = on. • You do not need to include invalid transitions, if any. • Recall that you need to complete 7 steps shown below. = (a) Draw a State Transition Diagram for the Mealy Machine (outputs on the arcs). (b) Create a State Transition Table from the State Transition Diagram. (c) Find binary representations of the states. (d) Rewrite the State Transition Table showing binary representations. (e) Write Boolean functions for the next states and outputs. (f) Minimize the Boolean functions. (g) Implement the Finite State Machine using combinatorial circuits and memory ele- ments.