8 Bit Array Multiplier Verilog Code Apr 2026

// Output assignment assign P[0] = s[0][0]; assign P[1] = s[1][0]; assign P[2] = s[2][1]; assign P[3] = s[3][2]; assign P[4] = s[4][3]; assign P[5] = s[5][4]; assign P[6] = s[6][5]; assign P[7] = s[7][6]; assign P[15:8] = s[7][7:0]; endmodule module tb_array_multiplier; reg [7:0] A, B; wire [15:0] P; array_multiplier_8bit_optimized uut (.A(A), .B(B), .P(P));

assign final_sum[7] = final_carry[6];

[ P = \sum_i=0^7 (A \cdot B_i) \cdot 2^i ] 8 bit array multiplier verilog code

// Final row (row 7) -> outputs become final product bits // P[1] to P[7] come from sum[0..6] and final additions wire [7:0] final_sum; wire [7:0] final_carry;

// Generate partial products: pp[i][j] = A[i] & B[j] genvar i, j; generate for (i = 0; i < 8; i = i + 1) begin : pp_gen for (j = 0; j < 8; j = j + 1) begin : bit_gen assign pp[i][j] = A[i] & B[j]; end end endgenerate // Output assignment assign P[0] = s[0][0]; assign

// Internal rows (1 to 6) genvar k; generate for (k = 1; k < 7; k = k + 1) begin : rows // First column of each row (half adder) ha ha_inst ( .a (pp[k][0]), .b (sum[k-1][k-1]), .sum (sum[k][0]), .carry(carry[k][0]) );

// Final row (i=7) wire [7:0] final_carry; generate for (j = 0; j < 7; j = j + 1) begin if (j == 0) ha ha_final (.a(pp[7][0]), .b(s[6][0]), .sum(s[7][j]), .carry(final_carry[j])); else fa fa_final (.a(pp[7][j]), .b(s[6][j]), .cin(final_carry[j-1]), .sum(s[7][j]), .cout(final_carry[j])); end assign s[7][7] = final_carry[6]; endgenerate output [15:0] P )

// First row (i=0) assign s[0][0] = pp[0][0]; assign c[0][0] = 1'b0; genvar j; generate for (j = 1; j < 8; j = j + 1) begin assign s[0][j] = pp[0][j]; assign c[0][j] = 1'b0; end endgenerate

endmodule The above manual connection for final product is simplified. A cleaner implementation uses a 2D array of carry-save adders. Below is a more elegant version using generate loops. 4.4 Optimized Structured Version module array_multiplier_8bit_optimized ( input [7:0] A, B, output [15:0] P ); wire [7:0] pp [0:7]; wire [7:0] s [0:7]; // sum between rows wire [7:0] c [0:7]; // carry between rows // Partial product generation generate for (i = 0; i < 8; i = i + 1) begin for (j = 0; j < 8; j = j + 1) begin assign pp[i][j] = A[i] & B[j]; end end endgenerate