Related Concepts: 04 BCD and Weighted Digital Codes | 06 Gray Code & Code Conversions

05 Excess-3 Code & Self-Complementing Logic

What is Excess-3 Code?

Excess-3 Code (abbreviated XS-3) is a 4-bit non-weighted, self-complementing binary-coded decimal system.

To obtain the Excess-3 code representation for any decimal digit ($0$ through $9$), add $3$ {binary 0011} to the decimal digit and convert the resulting sum to its 4-bit binary equivalent: $(N{)}_{10}\stackrel{+3}{\to }(N+3{)}_{10}⟶(XS-3{)}_2$

---

1. Characteristics of Excess-3 Code

Advantages (Merits)

• Self-Complementing Property: Taking the 1’s complement of an Excess-3 code word directly yields the Excess-3 code word for the 9’s complement of the corresponding decimal digit.
• Simplifies Decimal Subtraction: Simplifies hardware subtraction in BCD ALUs using 9’s complement arithmetic without needing special correction logic.
• Fault Detection (No All-Zero or All-One Words): The code words 0000 (decimal $-3$) and 1111 (decimal $+12$) are invalid Excess-3 code words for single decimal digits, aiding in wire fault detection.
• Unique 4-Bit Representation: Every decimal digit (0 to 9) maps uniquely to a distinct 4-bit code word.

Disadvantages (Demerits)

• Non-Weighted Code: Bit positions do not correspond to fixed numerical weights.
• Complex Pure Binary Arithmetic: Standard binary addition rules cannot be directly executed without post-addition correction steps.
• Interface Hardware Overhead: Requires dedicated code converter logic circuits when interfacing with standard 8421 BCD or binary buses.

---

2. The Self-Complementing Property (Formal Proof)

Formal Definition: Self-Complementing Code

A binary code for decimal digits is called self-complementing if taking the 1’s complement {flipping all bits 0 $\leftrightarrow$ 1} of the code word for digit $N$ yields the exact code word for its 9’s complement $(9-N)$.

$\text{1’s Complement of }[XS-3(N)]=XS-3(9-N)$

graph LR
    subgraph Decimal Domain
        N[Decimal Digit N = 2] -->|9's Complement: 9 - 2| N9[Decimal Digit 9 - N = 7]
    end
    
    subgraph XS-3 Binary Domain
        XS2[XS-3 of 2: 0101] -->|1's Complement Bit Flip| XS7[XS-3 of 7: 1010]
    end
    
    N -->|Add 3| XS2
    N9 -->|Add 3| XS7

Mathematical Proof (Using Decimal Digit 2)

This proof from class notes is frequently tested in term final examinations:

1. Select a decimal digit, $N=2$.
2. Compute the Excess-3 code for 2: $2+3=5⟹(0101{)}_2$
3. Take the 1’s complement of $(0101{)}_2$: $\text{1’s complement of }0101_2=1010_2$
4. Compute the 9’s complement of the decimal digit 2: $9-2=7$
5. Compute the Excess-3 code for 7: $7+3=10⟹1010_2$
6. Conclusion: Since the 1’s complement of the Excess-3 code for 2 (0101) equals 1010—which is identically the Excess-3 code for 7—Excess-3 code is proven to be self-complementing. $■$

---

3. Combinational Circuit Design: BCD to Excess-3 Code Converter

Designing a BCD to Excess-3 code converter is a classic 10-mark combinational logic problem.

• Inputs: 4-bit BCD number ($A,B,C,D$, where $A$ is MSB).
• Outputs: 4-bit Excess-3 number ($w,x,y,z$, where $w$ is MSB).

Truth Table & Don’t Care States:

Decimal	BCD Inputs ($ABCD$)	XS-3 Outputs ($wxyz$)
0	0 0 0 0	0 0 1 1
1	0 0 0 1	0 1 0 0
2	0 0 1 0	0 1 0 1
3	0 0 1 1	0 1 1 0
4	0 1 0 0	0 1 1 1
5	0 1 0 1	1 0 0 0
6	0 1 1 0	1 0 0 1
7	0 1 1 1	1 0 1 0
8	1 0 0 0	1 0 1 1
9	1 0 0 1	1 1 0 0
10–15	Invalid BCD States	Don’t Cares (X)

Minimized Output Boolean Equations (via K-Maps):

By mapping minterms $0-9$ and treating minterms $10-15$ as Don’t Care conditions:

1. Output $z$ (LSB): $z=D^{\prime }$
2. Output $y$: $y=CD+C^{\prime }{D}^{\prime }=(C\odot D)$
3. Output $x$: $x=B^{\prime }C+B^{\prime }D+B{C}^{\prime }{D}^{\prime }$
4. Output $w$ (MSB): $w=A+BC+BD$

---

Past Year Questions (PYQs)

1. Theoretical Proof (2021, 2023, 2025 - 8 to 10 Marks)

Question: Define self-complementary code. “Excess-3 code is a self-complementary code”—justify the statement.

• Solution: State the formal definition and write the complete step-by-step mathematical proof for digit 2 shown in Section 2.

2. Combinational Circuit Design (2018 - 10 Marks)

Question: Design a combinational circuit that accepts a 4-bit BCD number and generates an output binary number representing the Excess-3 code of the corresponding BCD number.

• Solution: Construct the truth table above, set states 10–15 as Don’t Cares ($X$), plot four 4-variable K-maps, derive the minimized equations ($w,x,y,z$), and draw the logic gate schematic.

3. Decoding Register Content (2022 - 12 Marks Partial)

Question: A 12-bit register holds 1000 1001 0111. What decimal value does it represent in Excess-3 code?

• Solution: Break into 4-bit groups: 1000 ($8$), 1001 ($9$), 0111 ($7$). Subtract 3 from each group: $8-3=5$, $9-3=6$, $7-3=4⟹564_{10}$.