full-Adder
A full adder takes three binary inputs: A, B, and Cin (carry-in), and produces two binary outputs: Sum and Cout (carry-out). Here’s the truth table for a full adder:
The input variables 'x' and 'y' represent the two
significant bits that are to be added together.
The third input variable 'z' represents the carry from the
previous lower significant position.
The outputs are denoted by 'S' for the sum and 'C' for the
carry.
The eight rows beneath the input variables represent all
possible combinations of 0s and 1s for these variables.
The input-output logical relationship of the full-adder
circuit can be described using two Boolean functions, one for each output
variable.
Each output Boolean function can be simplified using a
distinct mapping method.
Maps for a full-Adder:
The logic diagram for a full-adder circuit can be depicted
as follows:
