2021-08-17

Consider the FSM described by the state diagram shown below:

This FSM acts as an arbiter circuit, which controls access to some type of resource by three requesting devices. Each device makes its request for the resource by setting a signal r[i] = 1, where r[i] is either r[1], r[2], or r[3]. Each r[i] is an input signal to the FSM, and represents one of the three devices. The FSM stays in state A as long as there are no requests. When one or more request occurs, then the FSM decides which device receives a grant to use the resource and changes to a state that sets that device’s g[i] signal to 1. Each g[i] is an output from the FSM. There is a priority system, in that device 1 has a higher priority than device 2, and device 3 has the lowest priority. Hence, for example, device 3 will only receive a grant if it is the only device making a request when the FSM is in state A. Once a device, i, is given a grant by the FSM, that device continues to receive the grant as long as its request, r[i] = 1.

Write complete Verilog code that represents this FSM. Use separate always blocks for the state table and the state flip-flops, as done in lectures. Describe the FSM outputs, g[i], using either continuous assignment statement(s) or an always block (at your discretion). Assign any state codes that you wish to use.

下面展示一些 内联代码片。

module top_module (
    input clk,
    input resetn,    // active-low synchronous reset
    input [3:1] r,   // request
    output [3:1] g   // grant
); 
    parameter A=0,B=1,C=2,D=3;
    reg[1:0]state,n_state;
    //状态转化
    always@(posedge clk)begin
        if(~resetn)begin
            state <= A;
        end
        else begin
            state <= n_state;
        end 
    end
    //状态转化条件
    always@(*)begin
        case(state)
            A: n_state = r[1]? B:(r[2]? C:(r[3]? D:A));
            B: n_state = r[1]? B:A;
            C: n_state = r[2]? C:A;
            D: n_state = r[3]? D:A;
        endcase
    end
    assign g[3:1] = {state==D,state==C,state==B};

endmodule