Question

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 − 1, then repeats. For example, a watch uses a modulo 60 counter for the minutes and seconds that counts from 0 to 59.) When reset, the output should be 000. On each clock edge, the output should advance to the next Gray code. After reaching 100, it should repeat with 000.

Clearly show your black box, state transition diagram, next state and output tables, your state encodings, next state and output equations, and circuit diagram.

b) Now add an UP input. If UP = 1, the counter advances to the next number (i.e., from 000→001, 001→011, etc.). If UP = 0, the counter retreats to the previous number (i.e., from 000→100, 100→101, 101→111, etc.). Go through all the steps of FSM design (1. Identify inputs and outputs 2. Sketch state transition diagram 3. Write state transition table 4. Select state encodings 5. Rewrite state transition table with state encodings 6. Write output table 7. Write Boolean equations for next state and output logic 8. Sketch the circuit schematic). Clearly label each part and finish with drawing the circuit that implements the FSM.Table 1. Gray Codes Number Gray Code 001 011 010 110 2 4 101 100

0 0
Add a comment Improve this question Transcribed image text
✔ Recommended Answer
Answer #1

Oesion cf 3-b& modulo 8 gray code Coll n esm gTay Code Counte ネGray cede sequence given în tabla has 8 stace 3 blt Countcs- L30 4 , S oo S4 to (2) o i (3) 11 (4)o 0,95)Gio Cvt 0 2. BooCocot o (LSa) 月1 06 90 FFo fCi FFR 10 ofup reset,-d converter- o(K6) Men ufel the gray co e sequence feloosas 2epeat 2bit Couner s having stannely so, SI,, andita SlSu 35 101 S6 S? State transit 0ๆ able S tales 001 ΟΙ (6) S3- 01 O (7) S3# 01 1 (6) S4 100 As oops are consid eredl, Mertk statamifev Next # Rodean equat bus uR 0o o1 Soup 01 猀ー易 4291 CO O0 Ci LDD2 Dl PF2 FFI 42 vo 3

Add a comment
Know the answer?
Add Answer to:
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...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Similar Homework Help Questions
  • cpe

    : Design an FSM that implements a modulo 8 counter, also known as a 3-bit counter. The FSM should output the following sequence: 000-001-010-011-100-101-110-111 and then repeat indefinitely. Upon reset, the FSM should start outputting 000 and so on. Be sure to show all design steps (i.e., state transition diagram, state transition table, output table, state encodings, next state and output equations, and circuit schematic).

  • Question 4 State Machines (25 marks) a. (5 marks) A 3-bit Gray code counter advances on...

    Question 4 State Machines (25 marks) a. (5 marks) A 3-bit Gray code counter advances on positive clock edges and generates outputs in the sequence: 000, 001, 011, 010, 110, 111, 101, 100. Draw the assigned state table for a state machine implementing this counter. b. (10 marks) For the Gray code counter in part a, derive (unoptimised) equations for the next state as a function of the current state. c. (10 marks) Consider the following sequence detector. In each...

  • Design a Verilog model that describes the following state diagram. (Test bench and simulation are not required) 1. 01 10 1- 10 10 01 01 10 or 01) 01 Design a Verilog model that describes a synchr...

    Design a Verilog model that describes the following state diagram. (Test bench and simulation are not required) 1. 01 10 1- 10 10 01 01 10 or 01) 01 Design a Verilog model that describes a synchronous 3 bit counter. The counter has a counting mode control signal (M), when M-o, the counter counts up in the binary sequence, when M- 1, the counter advances through the Gray code sequence. (Test bench and simulation are required to verify the counter...

  • will give thumbs up need answer asap P3.94pts Implement a 3-bit synchronous gray code down-counter with...

    will give thumbs up need answer asap P3.94pts Implement a 3-bit synchronous gray code down-counter with positive-edge-triggered D flip-flops using graphical symbols of D flip-flops and any logic gates. You can refer to the table below to understand the 3-bit gray code (The desired behavior is as follows: 000 100 101 111 - 110 - 010011001 → 000 → ...). Decimal 1 Gray code 000 001 011 010 110 111 101 100 5 6

  • 3. Finite State Machine. Using a ROM based finite state machine (FSM), design a bi-directional repetitive...

    3. Finite State Machine. Using a ROM based finite state machine (FSM), design a bi-directional repetitive 3-bit modulo-6 (0,1,2,3,4,5) counter (see Table 3). The design has one input named Dir and three outputs named B2, B1 and BO. The outputs (B2, B1 and BO) are dependent upon being in the present state only. After each clock pulse, when Dir is at logic "O', the outputs (B2, B1, BO) step through the count sequence in following order:- 0,1,2,3,4,5. After each clock...

  • P5 (20 points): The following Moore FSM state table is incomplete. The clock for this FSM...

    P5 (20 points): The following Moore FSM state table is incomplete. The clock for this FSM (FSM 1) has a period of 100 microseconds such that the button for the input X, controlled by the user, cannot be pressed for only one clock cycle. In addition, button X, when pressed, will output X=0. Current Next State Output State X=0 X=1 w A reset) o IB A B 0 D G I: Draw a state diagram for this state table. II:...

  • please answer question 4 (all parts of question4 please) will rate! 3. (30 pts) Design a 2-bit Gray code generator that ropetitively delivers the sequence 00301911-10-00when the input signal UP-...

    please answer question 4 (all parts of question4 please) will rate! 3. (30 pts) Design a 2-bit Gray code generator that ropetitively delivers the sequence 00301911-10-00when the input signal UP- 1,or in reverse order 009 10기け01 →00→ when UP-0. Your design should include an asynchronous low. active reset operation: the FSM goes to 00 state when a reset signal is applied In addition to the state output z[1). 2[0]. there is a carry/borrow output bit e which is I when...

  • Design the following finite state machine (FSM). It has two 1-bit inputs (in1 and in2) 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...

  • Design a system whose output goes high only after 8 consecutive 1's appear on the input;...

    Design a system whose output goes high only after 8 consecutive 1's appear on the input; once the output goes high, it takes four consecutive 0's on the input to make the output go low again. You will use one switch as the input, and one button as the clock. Assign a binary state code to each state of your FSM. On a piece of paper, develop a truth table for the next state and output logic. On a piece...

  • Exercise 5.6: Generic Binary-to-Gray Converter The regular binary code, which consists of code words ordered according...

    Exercise 5.6: Generic Binary-to-Gray Converter The regular binary code, which consists of code words ordered according to their increas ing unsigned decimal values, constitutes the most commonly used digital code. In some kind operation opcode 000 ya+b a(N-1:0) b(N-1:0) a(N-1:0) unsigned ya b 001 y(N- 1:0) Arithmetic Arithmetic 010 y-a+b ya+b+cin y(N:0) b(N-1:0 circuit circuit 011 cout cin cin 100 ya+b signed 101 ya b opcode(2:0) opcode(2:0) 110 y-a+b (a) (b) (c) 111 ya+b+cin Figure 5.14 applications, however, gray code...

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
ADVERTISEMENT