Simple FSM1(asynchronous reset)

This is a Moore state machine with two states, one input, and one output. Implement this state machine. Notice that the reset state is B.

This exercise is the same as fsm1s, but using asynchronous reset.

题目网站
a

module top_module(
    input clk,
    input areset,    // Asynchronous reset to state B
    input in,
    output out);//  

    parameter A=0, B=1; 
    reg state, next_state;

    always @(*) begin    // This is a combinational always block
        //声明了这是一个组合逻辑电路
        // State transition logic
        case(state)
            A:begin
                if(in) begin
                	next_state=A;
            	end
            	else begin
                	next_state=B;
            	end
            end
            B:begin
                if(in) begin
                	next_state=B;
            	end
            	else begin
                	next_state=A;
            	end
            end
        endcase         
    end

    always @(posedge clk, posedge areset) begin    // This is a sequential always block
        //实现异步复位
        // State flip-flops with asynchronous reset
        if(areset)begin
            state<=B;
        end
        else begin
            state<=next_state;
        end
    end

    // Output logic
    // assign out = (state == ...);
    assign out=(state==B);
endmodule
posted @   江左子固  阅读(45)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· [翻译] 为什么 Tracebit 用 C# 开发
· 腾讯ima接入deepseek-r1,借用别人脑子用用成真了~
· Deepseek官网太卡,教你白嫖阿里云的Deepseek-R1满血版
· DeepSeek崛起:程序员“饭碗”被抢,还是职业进化新起点?
· 深度对比:PostgreSQL 和 SQL Server 在统计信息维护中的关键差异
点击右上角即可分享
微信分享提示