Updated ASU to use an explicit MUX rather than the XOR inversion 'trick' when calculating the operand

This commit is contained in:
riley committed 2026-09-14 00:13:17 +10:00
1 parent 4df723318b
commit c4ebde7692
1 file changed
+2 -2
+2 -2
View File
@@ -10,7 +10,8 @@ module asu #(parameter width = 2)(
always_comb begin always_comb begin
// A + (sub) ? B : -B // A + (sub) ? B : -B
// Adds an extra bit to all operands to calculate the carry bit. Not optimal for hardware synthesis // Adds an extra bit to all operands to calculate the carry bit. Not optimal for hardware synthesis
operand = (B ^ {(2**width){op}}); //operand = (B ^ {(2**width){op}});
operand = op == 1'b0 ? B : ~B;
{COUT, OUT_1} = A + operand + {{(2**width-1){1'b0}}, op}; {COUT, OUT_1} = A + operand + {{(2**width-1){1'b0}}, op};
end end
@@ -18,5 +19,4 @@ module asu #(parameter width = 2)(
// Cin for final bit in adder to later be xor'ed with COUT to determine if a signed overflow occured for the MIPS architecture // Cin for final bit in adder to later be xor'ed with COUT to determine if a signed overflow occured for the MIPS architecture
assign OUT_CIN = A[2**width-1] ^ operand[2**width-1] ^ OUT_1[2**width-1]; assign OUT_CIN = A[2**width-1] ^ operand[2**width-1] ^ OUT_1[2**width-1];
endmodule endmodule
`endif `endif