binary code to Excess-3 code, the input lines must supply the bit

EXP NO: 4 DESIGN & IMPLEMENTATION OF CODE

combination of elements as specified by code and the output lines generate
CONVERTOR
AIM: the corresponding bit combination of code. Each one of the four maps
To design and implement 4-bit represents one of the four outputs of the circuit as a function of the four input
(i) Binary to gray code converter
variables.
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter A two-level logic diagram may be obtained directly from the
(iv) Excess-3 to BCD code converter Boolean expressions derived by the maps. These are various other

possibilities for a logic diagram that implements this circuit. Now the OR gate
APPARATUS REQUIRED:
whose output is C+D has been used to implement partially each of three

Sl.No. COMPONENT SPECIFICATION QTY. outputs.

1. X-OR GATE IC 7486 1 LOGIC DIAGRAM:
2. AND GATE IC 7408 1 BINARY TO GRAY CODE CONVERTOR
3. OR GATE IC 7432 1
4. NOT GATE IC 7404 1
5. IC TRAINER KIT - 1
6. PATCH CORDS - As required

THEORY:
The availability of large variety of codes for the same discrete

elements of information results in the use of different codes by different

systems. A conversion circuit must be inserted between the two systems if

each uses different codes for same information. Thus, code converter is a

circuit that makes the two systems compatible even though each uses
K-Map for G3:
different binary code. The bit combination assigned to binary code to gray

code. Since each code uses four bits to represent a decimal digit. There are

four inputs and four outputs. Gray code is a non-weighted code. The input

variable are designated as B3, B2, B1, B0 and the output variables are

designated as C3, C2, C1, Co, from the truth table, combinational circuit

is designed. The Boolean functions are obtained from K-Map for each output

variable.

A code converter is a circuit that makes the two systems

compatible even though each uses a different binary code. To convert from
G3=B3
K-Map for G2:
K-Map for G0:

K-Map for G1: TRUTH TABLE:

Binary input Gray code output
B3 B2 B1 B0 G3 G2 G1 G0

0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 1
0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0
0 1 0 1 0 1 1 1
0 1 1 0 0 1 0 1
0 1 1 1 0 1 0 0
1 0 0 0 1 1 0 0
1 0 0 1 1 1 0 1
1 0 1 0 1 1 1 1
1 0 1 1 1 1 1 0
1 1 0 0 1 0 1 0
1 1 0 1 1 0 1 1
1 1 1 0 1 0 0 1
1 1 1 1 1 0 0 0
LOGIC DIAGRAM: K-Map for B2:

GRAY CODE TO BINARY CONVERTOR

K-Map for B1:

K-Map for B3:

B3 = G3
K-Map for B0: LOGIC DIAGRAM:
BCD TO EXCESS-3 CONVERTOR

TRUTH TABLE:
Gray CodeBinary Code
G3 G2 G1 G0 B3 B2 B1 B0

0 0 0 0 0 0 0 0 K-Map for E3:

0 0 0 1 0 0 0 1
0 0 1 1 0 0 1 0
0 0 1 0 0 0 1 1
0 1 1 0 0 1 0 0
0 1 1 1 0 1 0 1
0 1 0 1 0 1 1 0
0 1 0 0 0 1 1 1
1 1 0 0 1 0 0 0
1 1 0 1 1 0 0 1
1 1 1 1 1 0 1 0
1 1 1 0 1 0 1 1
1 0 1 0 1 1 0 0
1 0 1 1 1 1 0 1
1 0 0 1 1 1 1 0
1 0 0 0 1 1 1 1
E3 = B3 + B2 (B0 + B1)
K-Map for E2: K-Map for E0:

TRUTH TABLE:
BCD input Excess – 3 output
B3 B2 B1 B0 G3 G2 G1 G0
K-Map for E1:
0 0 0 0 0 0 1 1
0 0 0 1 0 1 0 0
0 0 1 0 0 1 0 1
0 0 1 1 0 1 1 0
0 1 0 0 0 1 1 1
0 1 0 1 1 0 0 0
0 1 1 0 1 0 0 1
0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 1
1 0 0 1 1 1 0 0
1 0 1 0 x x x x
1 0 1 1 x x x x
1 1 0 0 x x x x
1 1 0 1 x x x x
1 1 1 0 x x x x
1 1 1 1 x x x x
LOGIC DIAGRAM: K-Map for B:
EXCESS-3 TO BCD CONVERTOR

K-Map for C:

K-Map for A:

A = X1 X2 + X3 X4 X1
K-Map for D:

PROCEDURE:
(i) Connections were given as per circuit diagram.
(ii) Logical inputs were given as per truth table
(iii) Observe the logical output and verify with the truth tables.

RESULT:
Thus the code converters were designed and verified
using the corresponding truth table.

TRUTH TABLE:
Excess – 3 Input BCD Output

B3 B2 B1 B0 G3 G2 G1 G0

0 0 1 1 0 0 0 0
0 1 0 0 0 0 0 1
0 1 0 1 0 0 1 0
0 1 1 0 0 0 1 1
0 1 1 1 0 1 0 0
1 0 0 0 0 1 0 1
1 0 0 1 0 1 1 0
1 0 1 0 0 1 1 1
1 0 1 1 1 0 0 0
1 1 0 0 1 0 0 1