加法器乘法器.doc

HYPERLINK /chevroletss/article/details/6288984 \o Ripple-Carry Adder Ripple-Carry Adder 2011-03-30 15:38 26人阅读 HYPERLINK /chevroletss/article/details/6288984 \l comments#comments 评论(0) HYPERLINK javascript:void(0); \o 收藏 收藏 HYPERLINK /chevroletss/article/details/6288984 \l report#report \o 举报 举报 It is possible to create a logical circuit using multiple full adders to add N-bit numbers. Each full adder inputs a Cin, which is the Cout of the previous adder. This kind of adder is a ripple carry adder, since each carry bit ripples to the next full adder. Note that the first (and only the first) full adder may be replaced by a half adder. For a N-bit Ripple-Carry Adder, the propagation delay is (2N+1) ?t. That is, the propagation delay of a N-bit Ripple-Carry Adder will be monotonously increasing according to the bit width of input data. So, the propagation delay will be very large if the bit width increased to a large number. It’s very slow. //Edit by Ray@SEU.IC //Jan 10th, 2011 //Ver. 1.0 //Its a 4-bit ripple-carry adder using 4 Full_Adder module Ripple_Carry_Adder_Bit(A, B, Cin, Sum, Cout); input [3:0] A, B; input Cin; output [3:0]Sum; output Cout; wire Cout_0, Cout_1, Cout_2; Full_Adder u0(A[0],B[0],Cin, Sum[0], Cout_0); Full_Adder u1(A[1],B[1],Cout_0, Sum[1], Cout_1); Full_Adder u2(A[2],B[2],Cout_1, Sum[2], Cout_2); Full_Adder u3(A[3],B[3],Cout_2, Sum[3], Cout); endmodule HYPERLINK /chevroletss/article/details/6288958 \o Full Adder Full Adder 2011-03-30 15:32 18人阅读 HYPERLINK /chevroletss/article/details/6288958 \l comments#comments 评论(0) HYPERLINK javascript:void(0); \o 收藏 收藏 HYPERLINK /chevroletss/article/details/6288958 \l report#report \o 举报 举报 Full Adder Truth Table ? ,? //Edit by Ray@SEU.IC //Jan 10th 2011 //Ver. 1.0 module Full_Adder(A,B,Cin, Sum, Cout); input A, B, Cin; output Sum, Cout; assign Sum = A^B^Cin; assign Cout = (AB) | Cin(A^B); endmodule HYPERLINK /chevroletss/article/details/6289014 \o Carry Look-ahead Adder Carry Look-ahead Adder