题解 | Johnson Counter
Johnson Counter
https://www.nowcoder.com/practice/7ee6e9ed687c40c3981d7586a65bc22d
`timescale 1ns/1ns
module JC_counter(
input clk ,
input rst_n,
output reg [3:0] Q
);
//这道题主要就是找规律
always@(posedge clk or negedge rst_n)
if(!rst_n)
Q <= 0;
else
Q <= {~Q[0],Q[3:1]};
endmodule
查看7道真题和解析