Build a finite state machine using the following conditions.
There are two inputs stress (s) and hurry (h), and there are four selections (output) r =0, r= 1, r =2 , r=3.
The priority of the selections from high to low is 1 ,0 , 3, 2.
When stressed, we cannot select r =1.
If in hurry, cannot select r =0.
cannot select r =1 twice in three consecutive selections.
cannot repeat selections in a row.
Start at r=3 and does not select r =1 in last 5 selections.
Build a finite state machine using the following conditions. There are two inputs stress (s) and...
Design the following finite state machine (FSM). It has two 1-bit inputs (in1 and in2) and two 1-bit outputs (out1 and out2). The first output (out1) bit should be equal to one if, on both of the last two cycles, in1 and in2 were EQUAL to each other; otherwise, out1 should equal zero. The second output (out2) should be equal to 1 if, on the last cycle, in1 and in2 were NOT EQUAL to each other; otherwise, out2 should equal...
QUESTION 1 The following finite state machine is designed to produce an output which toggles continuously while its input a is high. A simple circuit implements this finite state machine using the controller model, but no additional hardware. a Off On F=0 F=1 Assuming that circuit starts off with F=0, as shown, fill out the timing diagram for its operation below: clk a O F clk a F clk O a F QUESTION 2 Take a moment to consider the...
please explain your answer!
2. Design a finite state machine that has the following behavior: Inputs-0,1 Outputs- 10,1) .The machine outputs 1 every time it detects a pattern "1010" otherwise it outputs 0 Assume that overlapping patterns are allowed. (20 points)
Desgin a state graph and state table of a state machine simulating the control of an automatic car wash. Depending on inputs from the user, the simulator will cycle through states representing inactive, rinse #1, soap spray, scrub, rinse #2, wax, rinse #3. There will be three inputs. One ("start") will activate the car wash, one ("deluxe") will choose between a normal cycle (skip the last two steps of wax, rinse #3) and a deluxe cycle, and one ("kill") will...
Give the answer for the above 7 questions independently
Construct a MEALY finite state machine for a “Wacky” mod 6 counter. If it receives a 1 it counts up by 1. If it receives a 0 it counts up by 2. An alarm sounds when the count reaches 4 or 5. 1. What are the machine states? 2. What are the inputs? 3. What are the outputs? 4. Draw state table. 5. Draw the state diagram. 6. Define the circuit...
Problem: Design a clocked synchronous state machine with two inputs A, and B, and a single output Z that is 1 is: .A had the same value at each of the two previous clock ticks, or B has been 1 since the last time that the first condition was true. In-Lab 1. 2. 3. 4. For the finite state machine (FSM), identify the minimum number of states required Draw the state transition diagram Complete the state transition table Derive the...
Q6: Consider a finite state machine with the following state table: N/S P/S Output X=0 X=1 Z A A B 0 B С A 1 С D A 1 D E F 1 E B F 1 F F E 0 G F E 0 H A B 0 I E K B F 1 L D A 1 F 1 a) reduce its states by using state table minimization. b) select an assignment for its states.
0/3 D6.15 Write an assembly main program that implements this Mealy finite state machine. happy The FSM state graph, shown below, is givenP and cannot be changed. The input is on Port A bit 0 and the output is on Port B bits 3,2,1,0. There are three states (happy, hungry, sleepy), and initial state is happy. hungry 1/8 1/2 143 0/4 sleepy a) Show the ROM-based FSM data structure b) Show the initialization and controller software. Initialize the direction registers,...
Finite state machine (FSM) counter design: Gray
codes have a useful property in that consecutive numbers differ in
only a single bit position. Table 1 lists a 3-bit modulo 8 Gray
code representing the numbers 0 to 7. Design a 3-bit modulo 8 Gray
code counter FSM.
a) First design and sketch a 3-bit modulo 8 Gray code counter
FSM with no inputs and three outputs, the 3-bit signal
Q2:0. (A modulo N counter counts from 0 to N −...
QUESTION 2 You are attempting to implement a NOR gate by using the BJT circuit shown in Figure 2. Note that the two BJTs are identical. Vec 3V • VOLT R RS w A w B OL Figure 2: NOR gate implementation There are two operational requirements that you need to achieve: The required output voltage thresholds are: Von = 2.4 and VoL = 0.4. The current load at the base cannot exceed a certain value, i.e. Is s 1(max)...