1. Design a 5-bit combination lock. The lock has 3 buttons: (i) a reset button for...
Fantastic news! We've Found the answer you've been seeking!
Question:
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.
Expert Answer:
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Posted Date:
Students also viewed these programming questions
-
List three specific parts of the Case Guide, Objectives and Strategy Section (See below) that you had the most difficulty understanding. Describe your current understanding of these parts. Provide...
-
Case Study: Quick Fix Dental Practice Technology requirements Application must be built using Visual Studio 2019 or Visual Studio 2017, professional or enterprise. The community edition is not...
-
Find the maximum value of (x, y, z) = x a y b z c for x, y, z 0 on the unit sphere, where a, b, c > 0 are constants.
-
Four long, parallel conductors carry equal currents of I = 5.00 A. Figure P30.21 is an end view of the conductors. The current direction is into the page at points A and B (indicated by the crosses)...
-
A machine costs $20,000 and has a 5-year useful life. At the end of the 5 years, it can be sold for $4000. If annual interest is 8%, compounded semiannually, what is the equivalent uniform annual...
-
After calculating the current ratio for an entity and finding that the ratios value was 0.5:1, a student decided that the company was in a sound position for paying its liquid liabilities. Respond to...
-
A flower shop uses 800 clay pots a month. The pots are purchased at $2 each. Annual carrying costs are estimated at $0.60 per pot per year and ordering costs are $20 per order. The manager has been...
-
Suppose you write a June expiration call option on Tesla with exercise price $85 and at the same time, write a June Tesla put option with exercise price $80. The premium of the call option is $0.90...
-
a. Prepare a UML class diagram with classes, associations, and multiplicities. b. Using the preceding information and the following attributes list, prepare a listing of the relational tables...
-
What is global stratification? Examine global stratification's relationship to economic inequality.
-
Find the following matrix product, if it exists. 35 -1 -1 3 -55 -2 02 -5 0
-
The Boeing Company issued a 40-year original maturity bond in 1991 with an annual coupon rate of 8.75%, par value of $1,000, and annual coupon payments. If prevailing nominal rates are 7.2%, what...
-
Discuss The History of Construction Drawings What the History of Drawings What are Drawings in Construction The Purpose of Construction Drawings Different types of Construction Drawings
-
Glycerol cannot be used as an energy source by organisms growing anaerobically using either the lactate or the ethanol fermentation pathway. Explain why glycerol can be used aerobically, and why it...
-
Consider at time t = 0 a flat 5% yield-to-maturity curve. A portfolio manager has money to invest over a 5-year horizon. He anticipates an interest rate increase by 1% in 1 year. Instead of buying...
-
A man runs towards the plane mirror at 2 ms. The relative speed of his image with respect to him will be (a) 2 ms (b) 4 ms- (c) 8 ms (d) 10 ms
-
In Exercises find dy/dx by implicit differentiation. xy - y = x
-
Determine the sequence generated by each of the following generating functions. (a) f(x) = (2x - 3)3 (b) f(x) = x4/(l - x) (c) f(x) = x3/(l - x2) (d) f(x) = 1/(1 + 3x) (e) f(x) = 1/(3 -x) (f) f(x) =...
-
Let G = (V, E) be a connected undirected graph. (a) What is the largest possible value for |V| if |E| = 19 and deg(v) > 4 for all v V? (b) Draw a graph to demonstrate each possible case in part (a).
-
(a) Develop a recursive definition for the multiplication of n real numbers x1, x2, . . . , xn, where n > 2. (b) For all real numbers x1, x2, and x3, the associative law of multiplication states that...
-
Analogy approach makes people end up building templates rather than building patterns. Explain.
-
Explain the concept behind constructing analysis pattern by using stability approach.
-
What are the advantages of using stability approach over direct and analogy approach?
Study smarter with the SolutionInn App