Bitspinner - 2-BIT-MULTIPLIER

2-BIT-MULTIPLIER

Design a 2-bit multiplier circuit that efficiently computes the product of two 2-bit binary numbers, outputting a 4-bit binary result.

2-bit-multiplier.v
2-bit-multiplier_tb.v

`default_nettype none 
 `timescale 1ns/1ns

`define assert(signal, value) \ 
     if (signal !== value) begin \ 
         $display("ASSERTION FAILED at %2d in %m: signal != value", $time); \ 
         $finish; \ 
     end

module multiplier_tb; 
    localparam integer DATA_WIDTH = 2;

reg [DATA_WIDTH-1:0] a; 
	reg [DATA_WIDTH-1:0] b; 
   
   wire [(2 * DATA_WIDTH)-1:0] c;    
   
   multiplier #(.DATA_WIDTH(DATA_WIDTH)) dut ( 
     .a(a), 
     .b(b), 
     .c(c)
   );

initial begin 
     // Initialize signals 
     a = 2'b00; b = 2'b00;
     #1;
     $display("Clock toggled at time %1t, a = %2b, b = %2b, c = %2b", $time, a, b, c); 
     `assert(c, 4'b0000);      
      a = 2'b01; b = 2'b00;
     #1;
     $display("Clock toggled at time %1t, a = %2b, b = %2b, c = %2b", $time, a, b, c); 
     `assert(c, 4'b0000);      
      a = 2'b01; b = 2'b01;
     #1;
      $display("Clock toggled at time %1t, a = %2b, b = %2b, c = %2b", $time, a, b, c); 
     `assert(c, 4'b0001);      
      a = 2'b11; b = 2'b11;
     #1;
	  $display("Clock toggled at time %1t, a = %2b, b = %2b, c = %2b", $time, a, b, c); 
     `assert(c, 4'b1001);      
      a = 2'b11; b = 2'b10;
     #1;
	  $display("Clock toggled at time %1t, a = %2b, b = %2b, c = %2b", $time, a, b, c); 
     `assert(c, 4'b0110);      
     $display("Success!");
     $finish;      
   end 
   
   initial begin 
     $dumpfile("multiplier.vcd"); 
     $dumpvars;  
   end 
 endmodule

Output:

2-BIT-MULTIPLIER

Not registered yet? Sign up to Bitspinner

About

Connect

Contact