in Digital Logic edited by
8,341 views
9 votes
9 votes

The Excess-$3$ code is also called

  1. Cyclic Redundancy Code
  2. Weighted Code
  3. Self-Complementing Code
  4. Algebraic Code
in Digital Logic edited by
8.3k views

5 Answers

12 votes
12 votes
Best answer

The Excess-3(XS3) code for a given decimal number is determined by adding '3' to each decimal digit in the given number and then replacing each digit of the newly found decimal number by its four bit binary equivalent. The table gives is the Excess-3 code. For example, XS3 code of 24 is obtained as

  2       4

+3    +3

  5       7

0101 0111

Thus, XS3 code of 24 is 0101 0111.

The key feature of the Excess-3 code is .that it is self complementing. In other words, the 1's complement of an Excess- 3 number is the Excess- 3 code for the 9's complement of the corresponding decimal number.

 

 For example, the Excess- 3 code for decimal 6 is 1001. The 1's complement of 1001 is 0110, which is the Excess-3 code for decimal 3, and 3 is the 9's complement of 6. This property of Excess-3 code makes it useful in some arithmetic operations.

 

Hence,Option(C)Self-complimenting Code is the correct choice.

selected by

1 comment

edited by

The proof of this statement :

The 1's complement of an Excess- 3 number is the Excess- 3 code for the 9's complement of the corresponding decimal number.

 Let's $x$ is the number that we are considering here ($0 \leq x \leq 9$ for Excess-3  rest are Pseudo-tetrade

Assuming $x$ is representated in decimal

Then the above statement can be written as :

$1's\ Complement(Excess3(x))=Excess3(9's\ Complement(x)) $

Since $x$ is in decimal, $Excess3(x)=x+3$

$9's\ Complement(x)=9-x$

and $1's\ Complement(x)=15-x$ [Since $0 \leq x \leq 9$ so it is representated using 4 bits hence for finding $1's\ Complement$ we need to substract binary x from binary 1111 .i.e 15 - x  in decimal )

Now we can write the

$L.H.S = 1's\ Complement(Excess3(x))$

$\Rightarrow 1's\ Complement(x+3)$

$\Rightarrow 15-(x+3)$

$\Rightarrow 12-x$

$R.H.S=Excess3(9's\ Complement(x))$

$\Rightarrow Excess3(9-x)$

$\Rightarrow (9-x)+3$

$\Rightarrow 12-x $

Hence $L.H.S=R.H.S$

1
1
1 vote
1 vote
Excess-3 code = BCD(1248) + 0011

After this we see that BCD(1248) is not Self Complementing code BUT Excess-3 code is Self Complementing code as well as Sequential code also.

Hence ans is (C) Self-Complementing Code
1 vote
1 vote

Excess-3 Code is also called

  • XS-3 code
  • Self-complimenting code

Option C


It is also non-weighted code, ie, the bit position doesn't play a role in determining the value. Other non-weighted codes: Gray Code.

Gray code is also called Reflected binary code, and it's considered a minimum error code.

0 votes
0 votes
Answer C

Excess 3 is Self-Complimenting code. It is also a Non-weighted Code
edited by
Answer: