Notice how our last full adder has a carry out.

注意我们的最后一个全加器是如何执行的。

We can build a full adder using half adders.

我们可以使用半加器构建一个全加器。

That’s it, we just made a full adder!

就是这样，我们刚刚做了一个全加器！

Then, we take any carry from this full adder, and run it into the next full adder that handles A2 and B2.

然后，我们从这个全加器中取出任何进位，并将其运行到下一个处理 A2 和 B2 的全加器中。

Again, we can go up a level of abstraction and wrap up this full adder as its own component.

同样，我们可以提升一个抽象级别并将这个全加器包装为它自己的组件。

So if we want to avoid overflows, we can extend our circuit with more full adders, allowing us to add 16 or 32 bit numbers.

所以如果我们想避免溢出，我们可以用更多的全加器扩展我们的电路，允许我们添加 16 或 32 位数字。

It's possible there was a carry from the previous addition of A0 and B0, so this time we need to use a full adder that also inputs the carry bit.

有可能之前A0和B0的加法有一个进位，所以这次我们需要使用一个全加器，它也输入进位位。

Notice how the carry bits ripple forward to each subsequent adder. For this reason, this is called an 8-bit ripple carry adder. Notice how our last full adder has a carry out.

请注意进位位如何波及到每个后续加法器。因此，这被称为 8 位纹波进位加法器。注意我们的最后一个全加器是如何执行的。

It's possible there was a carry from the previous addition of A0 and B0, so this time we need to use a full adder that also inputs the carry bit. We output this result as sum1.

有可能之前A0和B0的加法有进位，所以这次我们需要使用全加器，也输入进位位。我们将此结果输出为 sum1。

Then, we take any carry from this full adder, and run it into the next full adder that handles A2 and B2. And we just keep doing this in a big chain until all 8 bits have been added.

然后，我们从这个全加器中取出任何进位，并将其运行到下一个处理 A2 和 B2 的全加器中。我们只是在一个大链中继续这样做，直到添加了所有 8 位。

We can build a full adder using half adders. To do this, we use a half adder to add A plus B just like before – but then feed that result and input C into a second half adder.

我们可以使用半加器构建一个全加器。为此，我们使用半加器像以前一样将 A 和 B 相加，但随后将该结果输入并将 C 输入到第二个半加器中。