Question

3. Finite State Machine. Using a ROM based finite state machine (FSM), design a bi-directional repetitive 3-bit modulo-6 (0,1
0 0
Add a comment Improve this question Transcribed image text
Answer #1

it Dir -0 olp sequence is 0,1,2,3,4,5. it Dir-l olp sequence is 5,4,3,2,1,0, state diagram :{p:6 :40:1 ipp:0 AP ilp:1 100 ifpb state table (unaeed states not influded present stated B2B Noutstate Bel Bit Rd D, D. Po - - 10 0 0 - - 00 - 0 Q o - 0 0 0ดูแฯ state table: (Upatutado,=3,1,- tacitation went state is made o it any present state is Unused steuta p present state nequations for D2 ID, drobeing lomap solving! Dei 0,00 то а о о | 0 Няват, во то, в,0. ГФ) о | (мо No rommon о о Tirms) , , ,Do Biro TIRL 11 - 0 - O 0 0 11 10 1 we should not do reduction, IL map is not atall needed. Because ROM used ill, Rom is ProgGine of ROM needed is 2x 3 EX 441!impets 3 is no: otolp circuit diagram Uling ROM: Bi -D > h RO 11 D 13 14 BIPLA cloeleaddresses 5,6,7,9,14,15 not used in are Our RoM. The remaining need to realize addreeses are olpe DziDi, Do,

Add a comment
Know the answer?
Add Answer to:
3. Finite State Machine. Using a ROM based finite state machine (FSM), design a bi-directional repetitive...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 4) (3 points) You are asked to design a finite state machine (FSM) to control the...

    4) (3 points) You are asked to design a finite state machine (FSM) to control the tail-light of a 1965 Ford Thunderbird automobile. There are three lights on each side: i) Left: LA, LB, LC; ii) Right: RA, RB, RC. Corresponding to a Left (L) or a Right (R) turn signal, the flashing sequence is as shown in the figure below. [For example, when the left turn signal is activated, all the lights are off, then LA turns on, then...

  • 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...

    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 −...

  • In this lab, you will design a finite state machine to control the tail lights of...

    In this lab, you will design a finite state machine to control the tail lights of an unsual car. There are three lights on each side that operate in sequence to indicate thedirection of a turn. Figure ! shows the tail lights and Figure 2 shows the flashing sequence for (a) left turns and (b) right rums. ZOTTAS Figure 28:8: BCECECece BCECECECes BCECECECB BCECECBCB 8888 Figure 2 Part 1 - FSM Design Start with designing the state transition diagram for...

  • Design a Mealy FSM which functions as a sequence detector, generating two outputs y, z in...

    Design a Mealy FSM which functions as a sequence detector, generating two outputs y, z in the following way: a) The signal is applied sequentially to a single input line x. b) Initially both outputs y, z are set to 0. c) Output y is set to 1 when the sequence "10" has been applied to the input x; it should then be reset to 0 and the circuit should continue detecting next occurrence of "10". d) Output z is...

  • Design a finite state machine for a traffic light at the intersection of north-south traffic and...

    Design a finite state machine for a traffic light at the intersection of north-south traffic and east-west traffic. The light can be red, green or yellow. Assume a 30 second clock. Assume that the light will change only if a car is coming in the other direction. If cars are in both north-south and east-west, the light will change from one direction to the other.                                                         What are the machine states? What are the inputs? What are the outputs? Draw state...

  • Design a finite state machine for a traffic light at the intersection of north-south traffic and...

    Design a finite state machine for a traffic light at the intersection of north-south traffic and east-west traffic. The light can be red, green or yellow. Assume a 30 second clock. Assume that the light will change only if a car is coming in the other direction. If cars are in both north-south and east-west, the light will change from one direction to the other. What are the machine states? What are the inputs? What are the outputs? Draw state...

  • 6. (a) Each clock cycle, an input is provided to the finite state machine (FSM) below....

    6. (a) Each clock cycle, an input is provided to the finite state machine (FSM) below. Assuming that we start at state 00 and given an input for each tick, fill in the table to show the next state. (b) What bit sequence(s) does this FSM recognize? Your answer should be a string of bits (ex. “01” or “1110”). 11 0- 10 00 01 Time 0 1 2 3 4 5 6 input START 1 0 0 1 1 0...

  • Pre-Laboratorv Exercise: You are to design a state machine capable of controlling a 4-phase unipo...

    Pre-Laboratorv Exercise: You are to design a state machine capable of controlling a 4-phase unipolar stepper motor. This motor operates by energizing one (or more) of four coils of wire at a time to rotate a magnetized shaft to predetermined positions. Let us call the four coils A, B, C, and D. To make the motor rotate properly, the coils need to be turned on (driven at logic "1") and off (driven at logic "O") in the following sequence: ABCD-...

  • 0/3 D6.15 Write an assembly main program that implements this Mealy finite state machine. happy The FSM state graph...

    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,...

  • Consider a finite state machine with a control input called mode. When mode = 0, the...

    Consider a finite state machine with a control input called mode. When mode = 0, the machine operates as a mod-3 down counter, where the outputs are the count values. When mode = 1, the machine's output progresses through 1133 number (1 digit per clock cycle). Complete each of the steps which follow. (a) Draw the state diagram for this machine. (b) Write RTL Verilog code which implements this design. Submit your printed source code by the due date and...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT