Data & ComputingLogic Gates and Binary ArithmeticA-Level

Full Adder - Sum Calculator

The sum bit (S) of a full adder is calculated by performing the Exclusive OR (XOR) operation on two binary inputs (A and B) and the carry-in bit (C_in).

Use the free calculatorCheck the variablesOpen the advanced solver
Open Advanced Calculator

A lightweight calculator preview is not available for this formula yet.

Use the advanced calculator to solve it interactively.

Formula first

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.

Symbols

Variables

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

Sum Bit
Input Bit A
Input Bit B
Carry In

Apply it well

When To Use

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.

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.

One free problem

Practice Problem

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

Input Bit A1
Input Bit B0
Carry In1

Solve for:

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

The full worked solution stays in the interactive walkthrough.

References

Sources

  1. Mano, M. M., & Ciletti, M. D. (2017). Digital Design: With an Introduction to the Verilog HDL, VHDL, and SystemVerilog.
  2. A-Level Computer Science (OCR/AQA Specification), Logic Gates and Boolean Algebra modules.