加法器乘法器.docVIP

Ripple-Carry Adder 2011-03-30 15:38 26人阅读 评论(0) 收藏 举报 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