BCD TO EXCESS-3 CODE CONVERTER

Excess-3 code:
The excess 3 code is an important BCD code. It is mainly
used for arithmetic operations. It can add two decimal
numbers even if their sum exceeds nine. It simplifies
operations of arithmetic. It’s a way to represent decimal digits,
and each value equals the decimal digit value plus 3.

Components:
1. Switch Module (signal device)
2. Full adder (4)
3. Power Supply, 5V/DC stab.
4. Grid panel for circuit construction
5. Connection leads.
Circuit Design:
 Truth table:

Input BCD 3 Output excess-3 code

Decimal P Q Q Decimal
P4 P3 P2 Q4 Q2 S4 S3 S2 S1
digit 1 3 1 digit
0 0 0 0 0 0 0 1 1 3
1 0 0 0 1 0 1 0 0 4
2 0 0 0 0 0 1 0 1 5
3 0 0 1 1 0 1 1 0 6
4 0 1 0 0 0 1 1 1 7
0 0 1 1
5 0 1 0 1 1 0 0 0 8
6 0 1 1 0 1 0 0 1 9
7 0 1 1 1 1 0 1 0 10
8 1 0 0 0 1 0 1 1 11
9 1 0 0 1 1 1 0 0 12

Logic Function:
S1 = P1’
S2 = (P2 Ꚛ P1)’
S3 = P3 Ꚛ (P2 + P1)
S4 = P4 + P3 (P2 + P1)

Operational Description of BCD to excess-3 code

converter:
The Excess-3 code can be calculated by adding 3 to BCD

Gate Diagram:
advantages of excess-3 code which make it
required to use:
1. These codes are self-complementary.
2. These codes use biased representation.
3. The excess-3 code has no limitation, so that it considerably
simplifies arithmetic operations.
4. The codes 0000 and 1111 can cause a fault in the
transmission line. The excess-3 code doesn't use these
codes and gives an advantage for memory organization.
5. These codes are usually unweighted binary decimal codes.
6. This code has a vital role in arithmetic operations. It is
because it resolves deficiencies which are encountered
when we use the 8421 BCD code for adding two decimal
digits whose sum is greater than 9.
 BCD adder

Truth table:
Decimal Binary sum BCD sum
K S3 S2 S1 S0 C S7 S6 S5 S4
0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 1 0 0 0 0 1
2 0 0 0 1 0 0 0 0 1 0
3 0 0 0 1 1 0 0 0 1 1
4 0 0 1 0 0 0 0 1 0 0
5 0 0 1 0 1 0 0 1 0 1
6 0 0 1 1 0 0 0 1 1 0
7 0 0 1 1 1 0 0 1 1 1
8 0 1 0 0 0 0 1 0 0 0
9 0 1 0 0 1 0 1 0 0 1
10 0 1 0 1 0 1 0 0 0 0
11 0 1 0 1 1 1 0 0 0 1
12 0 1 1 0 0 1 0 0 1 0
13 0 1 1 0 1 1 0 0 1 1
14 0 1 1 1 0 1 0 1 0 0
15 0 1 1 1 1 1 0 1 0 1
16 1 0 0 0 0 1 0 1 1 0
17 1 0 0 0 1 1 0 1 1 1
18 1 0 0 1 0 1 1 0 0 0
19 1 0 0 1 1 1 1 0 0 1
K_map:
K=0
s1s0 00 01 11 10
s3s2
00 0 0 0 0
01 0 0 0 0
11 1 1 1 1
10 0 0 1 1

K=1
s1s0 00 01 11 10
s3s2
00 1 1 1 1
01 X X X X
11 X X X X
10 X X X X

C = K + S3 (S2 + S1)
Circuit Design: