Exams/review2015 fsm

最新推荐文章于 2023-06-29 10:21:45 发布

ic小白白白

最新推荐文章于 2023-06-29 10:21:45 发布

阅读量445

点赞数 2

分类专栏： verilog 文章标签： verilog

本文链接：https://blog.csdn.net/weixin_45614076/article/details/121711913

版权

verilog 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

这篇文章详细介绍了如何使用有限状态机（FSM）设计一个计时器，该计时器在接收到特定序列1101时启动，通过4位移位确定延迟，等待计数器完成并通知用户，直到用户确认。着重于FSM的实现和输入输出逻辑控制。

摘要由CSDN通过智能技术生成

This is the fourth component in a series of five exercises that builds a complex counter out of several smaller circuits. See the final exercise for the overall design.

You may wish to do FSM: Enable shift register and FSM: Sequence recognizer first.

We want to create a timer that:

is started when a particular pattern (1101) is detected,
shifts in 4 more bits to determine the duration to delay,
waits for the counters to finish counting, and
notifies the user and waits for the user to acknowledge the timer.
In this problem, implement just the finite-state machine that controls the timer. The data path (counters and some comparators) are not included here.

The serial data is available on the data input pin. When the pattern 1101 is received, the state machine must then assert output shift_ena for exactly 4 clock cycles.

After that, the state machine asserts its counting output to indicate it is waiting for the counters, and waits until input done_counting is high.

At that point, the state machine must assert done to notify the user the timer has timed out, and waits until input ack is 1 before being reset to look for the next occurrence of the start sequence (1101).

The state machine should reset into a state where it begins searching for the input sequence 1101.

Here is an example of the expected inputs and outputs. The ‘x’ states may be slightly confusing to read. They indicate that the FSM should not care about that particular input signal in that cycle. For example, once a 1101 pattern is detected, the FSM no longer looks at the data input until it resumes searching after everything else is done.
在这里插入图片描述
这个题主要是前面几题合起来，找准时序，问题不大。

module top_module (
    input clk,
    input reset,      // Synchronous reset
    input data,
    output shift_ena,
    output counting,
    input done_counting,
    output done,
    input ack );
    
    parameter idle=0, bit1=1, bit2=2, bit3=3, shift=4,count = 5, finish=6;
    reg [2:0] state, next_state;
    reg [2:0] cnt;
    always @(*)
        begin
            case(state)
                idle: next_state = data ? bit1 : idle;
                bit1: next_state = data ? bit2 : idle;
                bit2: next_state = data ? bit2 : bit3;
                bit3: next_state = data ? shift: idle;
                shift: next_state = (cnt == 4) ? count : shift;
                count: next_state = done_counting ? finish : count;
                finish: next_state = ack ? idle : finish;
            endcase
        end
    always @(posedge clk)
        begin
            if(reset)
                begin state<= idle; end
            else
                state <= next_state;
            case(next_state)
                shift: cnt <= cnt + 1;
                default: cnt <=0;
            endcase
        end

    //组合逻辑输出
    assign shift_ena = (state == shift);
    assign counting = (state == count);
    assign done = (state == finish);
endmodule