Takes in a remainder and adds the X, Y, and Remainder to get a S and C_out (extra remainder)
- The 3 inputs are and the 2 outputs are where X and Y are what are added, S is the sum, and C is the remainder in both scenarios
- That’s what makes it different from the half-adder! Used to create a Ripple-Carry Binary Adder
Design
Based on the truth table
We get this:
However, there is an optimization!
- Technically this is worse than what the K-map gives, BUT it comes with the optimization since we have the half-adder from before with already calculates .
- We are not required to think about this but it is interesting
The given, optimized design looks like this:
