Full Adder - Sum Equation, Derivation & Rearrangements

Core idea

Overview

In digital circuit design, a full adder is a fundamental building block that handles the addition of two binary bits while accounting for a carry bit from the previous position. The XOR operation ensures that the output bit is 1 only when an odd number of inputs are high, effectively capturing the parity of the binary addition.

When to use: Use this when designing combinatorial logic circuits or calculating binary sums in multi-bit arithmetic units.

Why it matters: It is the foundational logic used in all modern CPU Arithmetic Logic Units (ALUs) to perform integer addition.

Symbols

Variables

S = Sum Bit, A = Input Bit A, B = Input Bit B, C_{in} = Carry In

S

Sum Bit

V a r iab l e

A

Input Bit A

V a r iab l e

B

Input Bit B

V a r iab l e

C_{in}

Carry In

V a r iab l e

Walkthrough

Derivation

Derivation of Full Adder - Sum

The sum bit of a full adder is derived from the Boolean logic required to output a 1 only when an odd number of inputs are high. This is expressed through the associative property of the XOR operation applied to three input bits.

The circuit operates using standard binary logic (0 and 1).
The XOR (⊕) operator is commutative and associative.
The full adder considers three inputs: two operand bits (A, B) and a carry-in bit ( $C_{i}$ n).

1

Define the Truth Table

A full adder outputs 1 for the Sum bit if the count of high inputs is odd (1 or 3 inputs high). In minterm notation, these are (001, 010, 100, 111).

S = \sum m (1, 2, 4, 7)

Note: A sum of 1 occurs when the number of inputs set to high is odd.

2

Express using Boolean Logic

Write the logical expression for the minterms identified in the truth table.

S = \overset{ˉ}{A} \overset{ˉ}{B} C_{in} + \overset{ˉ}{A} B \overset{ˉ}{C_{in}} + A \overset{ˉ}{B} \overset{ˉ}{C_{in}} + A B C_{in}

Note: This is the Sum-of-Products (SOP) form.

3

Apply Factorization

Factor out A and not-A terms to identify the XOR and XNOR patterns.

S = \overset{ˉ}{A} (\overset{ˉ}{B} C_{in} + B \overset{ˉ}{C_{in}}) + A (\overset{ˉ}{B} \overset{ˉ}{C_{in}} + B C_{in})

Note: Look for patterns (B XOR $C_{i}$ n) and (B XNOR $C_{i}$ n).

4

Simplify using XOR Properties

Recognize that (B XOR $C_{i}$ n) is XOR and (B XNOR $C_{i}$ n) is the complement of XOR. Let X = (B XOR $C_{i}$ n), then S = NOT(A)X + A(NOT(X)), which is the definition of A XOR X.

S = \overset{ˉ}{A} (B \oplus C_{in}) + A (\overline{B \oplus C_{in}})

Note: A XOR (B XOR C) = A ⊕ B ⊕ C.

5

Final Formula

Substitute back to reach the simplified associative XOR expression.

S = A \oplus B \oplus C_{in}

Note: The XOR operation essentially acts as an 'odd parity' checker.

Result

S = A \oplus B \oplus C_{in}

Source: A-Level Computer Science (OCR/AQA Specification), Logic Gates and Boolean Algebra modules.

Why it behaves this way

Intuition

Think of the XOR operation as a 'parity toggle.' Imagine a light switch that toggles state every time you flip it. If you have three switches (A, B, and $C_{i}$ n), the light ends up ON (1) if an odd number of switches are flipped (1 or 3), and OFF (0) if an even number are flipped (0 or 2).

S

Sum output

The resulting value of the addition at the current bit position, excluding the carry-out value.

A, B

Binary addends

The two primary binary digits being combined in the current calculation step.

C_{in}

Carry-in

The 'overflow' or 'remainder' from the previous addition step to the right, which must be added to the current column.

Signs and relationships

⊕ (XOR): The XOR operator (Exclusive OR) represents 'addition without carry'. It outputs 1 only when inputs are unequal, effectively acting as an 'odd-parity' checker for the three input bits.

One free problem

Practice Problem

Calculate the sum output (S) for a full adder where A=1, B=0, and $C_{i}$ n=1.

Input Bit A1

Input Bit B0

Carry In1

Solve for: $S$

Hint: XORing two 1s results in 0, and 0 XORed with 0 results in 0.

The full worked solution stays in the interactive walkthrough.

Where it shows up

Real-World Context

This logic is implemented in the circuits inside a smartphone's processor to add two numbers stored in registers.

Study smarter

Tips

Remember that XOR (⊕) behaves like 'addition modulo 2'.
If you have an odd number of inputs set to 1, the output will always be 1.
Draw a truth table if you are unsure about the state combinations.

Avoid these traps

Common Mistakes

Confusing the sum output (XOR) with the carry-out output (AND/OR gates).
Forgetting to include the carry-in bit in the calculation.

Keep going

Related Formulas

Common questions

Frequently Asked Questions

The sum bit of a full adder is derived from the Boolean logic required to output a 1 only when an odd number of inputs are high. This is expressed through the associative property of the XOR operation applied to three input bits.

Use this when designing combinatorial logic circuits or calculating binary sums in multi-bit arithmetic units.

It is the foundational logic used in all modern CPU Arithmetic Logic Units (ALUs) to perform integer addition.

Confusing the sum output (XOR) with the carry-out output (AND/OR gates). Forgetting to include the carry-in bit in the calculation.