<<< Half Adder Discussion     Index     One-bit Full Adder Example >>>

4. The Full Adder

  • To construct a full binary adder circuit, we need three inputs and two outputs, as specified by the following truth table:

     

    INPUTS OUTPUTS
    A B CARRY IN CARRY OUT SUM
    0 0 0 0 0
    0 0 1 0 1
    0 1 0 0 1
    0 1 1 1 0
    1 0 0 0 1
    1 0 1 1 0
    1 1 0 1 0
    1 1 1 1 1

     

  •  

     

  • The truth table includes five columns as follows:

    1. input A

    2. input B

    3. carry IN for the current column

    4. resulting carry OUT (carry-over), generated for the next column

    5. the resulting SUM.

<<< Half Adder Discussion     Index     One-bit Full Adder Example >>>