A straight-to-the-point method: convert each binary number to decimal, add, convert the sum back to binary.
Each bit is a power of two (rightmost bit = 2⁰).
Bit | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
---|---|---|---|---|---|---|---|---|
Val | 128 | 64 | 32 | 16 | 8 | 4 | 2 | 1 |
Example (6-bit width):
000100₂
= 0·32 + 0·16 + 0·8 + 1·4 + 0·2 + 0·1
= 4₁₀
000100₂ → 4
000011₂ → 3
4 + 3 = 7
Divide by 2 repeatedly, keep remainders, read them bottom-up.
7 ÷ 2 = 3 r1 ← bit 0
3 ÷ 2 = 1 r1 ← bit 1
1 ÷ 2 = 0 r1 ← bit 2
→ 111₂
Pad with leading zeros to the original bit-width (6 here):
000111₂
000011₂ = 3
Add
4 + 3 = 7
Convert back
Result
000100₂ + 000011₂ = 000111₂
Convert, add, convert back:
Use the same three-step process and verify your answers.