zoukankan      html  css  js  c++  java
  • 复位模块

    module rst_generator
    #(parameter DELAY=24'd0 )
    (
      input clk,
      output reg rst
    );

    reg [23:0] rst_counter;
    reg [2:0] rst_state;
    localparam RST_IDLE = 3'b001,
           RST_WAIT = 3'b010,
           RST_DONE = 3'b100;
    initial
    begin
      rst_state <= RST_IDLE;
    end
    always @ (posedge clk)
    begin
      case(rst_state)
        RST_IDLE:
        begin
          rst <= 1'b1; //高电平有效
          rst_counter <= 24'd0;
          rst_state <= RST_WAIT;
        end
        RST_WAIT:
        begin
          if(rst_counter < DELAY)
          begin
            rst_state <= RST_WAIT;
            rst_counter <= rst_counter + 24'd1;
          end
          else
          begin
            rst_state <= RST_DONE;
            rst_counter <= 24'd0;
          end
        end
        RST_DONE:
        begin
          rst <= 1'b0;
          rst_state <= RST_DONE;
        end
        default rst_state <= RST_IDLE;

      endcase
    end
    endmodule

    //顶层例化

    rst_generator
    #(
      .DELAY(24'd128)
    )
    rst_generator_inst
    (
      .clk(clk),
      .rst(rst)
    );

  • 相关阅读:
    扫描线算法
    [Baltic 2001]Mars Maps
    Lost Cow
    李超线段树
    多种方法求解Pku3468 A Simple Problem with Integers
    陈老师的福利
    leetcode 673. 最长递增子序列的个数
    #10043.「一本通 2.2 例 1」剪花布条
    PTA7-1
    6-1 实验三哈夫曼树 (15分)
  • 原文地址:https://www.cnblogs.com/achangchang/p/11260103.html
Copyright © 2011-2022 走看看