What you will be able to do. By the end of this chapter you will have built an adder out of gates, turned it into a subtractor, and built a small multiplier. You will be able to say how many bits the answer of an addition, a subtraction or a multiplication needs, explain why division costs so much more than multiplication, and say how a chip handles functions such as sine and logarithm, for which no simple circuit exists.
A promise to keep
The chapter on number systems worked out arithmetic on paper and made two promises: that an adder is built entirely from basic gates, and that the same adder can subtract. You now have everything needed to keep both. You can go from a truth table to gates, you can write buses and the conditional operator in Verilog, and you know what 2's complement is.
Start from the half adder, which you have already operated. It adds two bits and produces a sum bit and a carry: the sum is A XOR B and the carry is A AND B. It is called half an adder because it is not enough for a column in the middle of a sum. Look at any column of a paper addition except the rightmost: it has three bits to add, the two digits and the carry arriving from the column on its right.