An adder-subtractor can be built from an adder by optionally negating one of the inputs, which is equivalent to inverting the input then adding 1. The net result is a circuit that can do two operations: (a + b + 0) and (a + ~b + 1). See Wikipedia if you want a more detailed explanation of how this circuit works.
Build the adder-subtractor below.
You are provided with a 16-bit adder module, which you need to instantiate twice:
module add16 ( input[15:0] a, input[15:0] b, input cin, output[15:0] sum, output cout );
Use a 32-bit wide XOR gate to invert the b input whenever sub is 1. (This can also be viewed as b[31:0] XORed with sub replicated 32 times. See replication operator.). Also connect the sub input to the carry-in of the adder.
我们可以从题意中了解到,我们先是了解了减法器就是加法器的任意一个输入取反得到的,它也是反转加法器的每一位输入之后在对反转之后的数据加1,其结果就是减法器的输入。因此题目要求我们用这个模块产生两个数,第一个是a + b 另一个是 a ~ b + 1(本质上就是a - b的操作,取反之后加1不就是减吗)
所以看图1,在低16位的加法器中,进位是用sub来表示,当sub = 0时,说明我们要做的是加法;当sub = 1时,说明我们要做的是减法,是取反在加1,另外取反操作是针对b这个向量而言,所以需要的是32位的一个异或门。可以得到程序如下:
module top_module(
input [31:0] a,
input [31:0] b,
input sub,
output [31:0] sum
);
wire [31:0] b_change;
assign b_change = b ^ {32{sub}};//这里一开始忘记可以这样子写,看到那个链接才想起来,这是复制
//操作,32代表复制的次数,sub是需要复制的那个变量
wire cout;
add16 add16_1(//低16位
.a(a[15:0]),
.b(b_change[15:0]),
.cin(sub),
.sum(sum[15:0]),
.cout(cout)
);
add16 add16_2(//高16位
.a(a[31:16]),
.b(b_change[31:16]),
.cin(cout),
.sum(sum[31:16])
);
endmodule