Slide 11 of 65
A one-bit full adder will be used in the next few pages as an ongoing example.
One way to describe the function of a full-bit adder is as a look-up table. In other words, we can define every mapping of the inputs to the outputs, and encode them as a case statement in the body of the process. Here, the logic tables used to generate the outputs, Sum and Cout, are shown.