BCD Self-complementing codes Self-complementing code is a code whose arithmetic and logic complement are the same BCD self-complement are designed so the arithmetic diminished complement can be found by taking the logical complement _a bit- by-bit inversion of BCD code 10.0-1
1 0, 0 1 BCD Self-complementing codes • BCD self-complement are designed so the arithmetic diminished complement can be found by taking the logical complement ,a bitby-bit inversion of BCD code • Self-complementing code is a code whose arithmetic and logic complement are the same
BCD Self-complementing codes Decimal 2421 Ex-3. Diminish radix complement 00000011 X=6 00010100 10 0123456789 00100101 1=10-1-6=310 00110110 01000111 10111000 °6ex-3=1001 11001001 11011010 Logic complement of 6ex-3 is 0110 11101011 3ex3=0110 11111100
0 1 2 3 4 5 6 7 8 9 Decimal 2421 Ex-3 0000 0001 0010 0011 0100 1011 1100 1101 1110 1111 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 BCD Self-complementing codes • Diminish radix complement •X=610 •X-1 ’ = 10-1-6=310 • 6ex-3 = 1001 • Logic complement of 6ex-3 is 0110. • 3ex-3 = 0110