HDLBits刷题（电路-更多电路）

最新推荐文章于 2023-03-07 19:27:41 发布

数字IC小菜鸡

最新推荐文章于 2023-03-07 19:27:41 发布

阅读量94

点赞数

分类专栏： HDLBits刷题专栏文章标签： fpga开发

本文链接：https://blog.csdn.net/weixin_45422522/article/details/127982241

版权

HDLBits刷题专栏专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Relu 90

module top_module(
    input clk,
    input load,
    input [511:0] data,
    output [511:0] q ); 
    always @(posedge clk)begin
        if(load)
            q <= data;
        else
            q <= {1'b0,q[511:1]}^{q[510:0],1'b0};
    end
endmodule

Relu 110

module top_module(
    input clk,
    input load,
    input [511:0] data,
    output [511:0] q
); 
    always @(posedge clk)begin
        if(load)
            q <= data;
        else
            q <=( ~(q>>1)&(q<<1))|(~q&(q<<1)|q&~(q<<1));
    end
endmodule

Conway's Game of life 16x16

module top_module(
    input clk,
    input load,
    input [255:0] data,
    output [255:0] q ); 
    reg [3:0] count;
    integer i;
    always @(posedge clk)
        begin
            if(load)begin
                q <= data;
            end
            else begin
                for(i=0;i<256;i++)begin
                    if(i == 0)begin
                        count = q[255] + q[240] + q[241] + q[15] + q[1] + q[31] + q[16] + q[17];
                    end
                    else if(i == 15)begin
                        count = q[254] + q[255] + q[240] + q[14] + q[0] + q[30] + q[31] + q[16];
                    end
                    else if(i == 240)begin
                        count = q[239] + q[224] + q[225] + q[255] + q[241] + q[15] + q[0] + q[1];
                    end
                    else if(i == 255)begin
                        count = q[238] + q[239] + q[224] + q[254] + q[240] + q[15] + q[0] + q[14];
                    end
                    else if( i>0 && i<15)begin
                        count = q[239+i]+q[240+i]+q[241+i]+q[i-1]+q[i+1]+q[i+15]+q[i+16]+q[i+17];
                    end
                    else if(i>240 && i<255)begin
                        count = q[i-17]+q[i-16]+q[i-15]+q[i-1]+q[i+1]+q[i-239]+q[i-240]+q[i-241];
                    end
                    else if( i%16 == 0)begin
                        count = q[i-1]+q[i-16]+q[i-15]+q[i+15]+q[i+1]+q[i+31]+q[i+16]+q[i+17];
                    end
                    else if(i % 16 == 15)begin
                        count = q[i-17]+q[i-16]+q[i-31]+q[i-1]+q[i-15]+q[i+15]+q[i+16]+q[i+1];
                    end
                    else begin
                        count = q[i-17]+q[i-16]+q[i-15]+q[i-1]+q[i+1]+q[i+15]+q[i+16]+q[i+17];
                    end
 
                    case(count)
                        4'd0:q[i] <= 1'b0;
                        4'd1:q[i] <= 1'b0;
                        4'd2:q[i] <= q[i];
                        4'd3:q[i] <= 1'b1;
                        4'd4:q[i] <= 1'b0;
                        default:q[i] <= q[i];
                    endcase
                end
            end
        end
endmodule