Verilog刷题笔记14-Toy模板网

这篇具有很好参考价值的文章主要介绍了Verilog刷题笔记14。希望对大家有所帮助。如果存在错误或未考虑完全的地方，请大家不吝赐教，您也可以点击"举报违法"按钮提交疑问。

题目：
One drawback of the ripple carry adder (See previous exercise) is that the delay for an adder to compute the carry out (from the carry-in, in the worst case) is fairly slow, and the second-stage adder cannot begin computing its carry-out until the first-stage adder has finished. This makes the adder slow. One improvement is a carry-select adder, shown below. The first-stage adder is the same as before, but we duplicate the second-stage adder, one assuming carry-in=0 and one assuming carry-in=1, then using a fast 2-to-1 multiplexer to select which result happened to be correct.

In this exercise, you are provided with the same module as the previous exercise, which adds two 16-bit numbers with carry-in and produces a carry-out and 16-bit sum. You must instantiate three of these to build the carry-select adder, using your own 16-bit 2-to-1 multiplexer. add16

Connect the modules together as shown in the diagram below. The provided module has the following declaration: add16

module add16 ( input[15:0] a, input[15:0] b, input cin, output[15:0] sum, output cout );

Verilog刷题笔记14,笔记
解法：

module top_module(
    input [31:0] a,
    input [31:0] b,
    output [31:0] sum
);
    wire [15:0]sum1,sum2,sum3;
	wire sel;
	add16 add161 (
		.a(a[15:0]), 
		.b(b[15:0]), 
		.cin(0), 
		.sum(sum1), 
		.cout(sel) 
	);  
	add16 add162 (
		.a(a[31:16]), 
		.b(b[31:16]), 
		.cin(0), 
		.sum(sum2), 
		.cout() 
	); 
	add16 add163 (
		.a(a[31:16]), 
		.b(b[31:16]), 
		.cin(1), 
		.sum(sum3), 
		.cout() 
	); 
	always@(*) begin
		case(sel)
			0 : sum = {sum2,sum1};
			1 : sum = {sum3,sum1};
		endcase
	end
  
endmodule