Scribd
Upload
6 views9 pages

Exp No5

The document outlines the design and implementation of a 4-bit code converter, including Binary to Gray code, Gray to Binary code, Excess-3 to BCD, and BCD to Excess-3 converters. It provides logic diagrams, truth tables, and required apparatus for each converter. The procedure involves making connections as per circuit diagrams, inputting logical values, and verifying outputs against truth tables.

Uploaded by

lakshya singhal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views9 pages

Exp No5

The document outlines the design and implementation of a 4-bit code converter, including Binary to Gray code, Gray to Binary code, Excess-3 to BCD, and BCD to Excess-3 converters. It provides logic diagrams, truth tables, and required apparatus for each converter. The procedure involves making connections as per circuit diagrams, inputting logical values, and verifying outputs against truth tables.

Uploaded by

lakshya singhal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

EXPT NO.

:
DATE :
DESIGN AND IMPLEMENTATION OF CODE CONVERTOR
AIM:
To design and implement 4-bit
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) Excess 3 to BCD
(iv) BCD to Excess 3

APPARATUS REQUIRED: IC 7432, 7486, 7404,7408,7411 IC trainer kit, Connector


wires

1. BINARY TO GRAY CODE CONVERTOR

Logic Diagram

K-Map for G3:


G3 = B3
K-Map for G2:

K-Map for G1:

K-Map for G0:


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
2. GRAY CODE TO BINARY CONVERTOR
Logic Diagram

K-Map for B3:

B3 = G3

K-Map for B2:


K-Map for B1:

K-Map for B0:


Truth Table:
| Gray Code | Binary Code |

G3 G2 G1 G0 B3 B2 B1 B0

0 0 0 0 0 0 0 0
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
3. BCD to EXCESS 3 CODE CONVERTOR
Logic Diagram

Truth Table:
4. EXCESS 3 to BCD CODE CONVERTOR
Logic Diagram

Truth table

EXCESS-3 BCD
𝑿𝟑 𝑿𝟐 𝑿𝟏 𝑿𝟎 𝑩𝟑 𝑩𝟐 𝑩𝟏 𝑩𝟎
0 0 0 0 x x x x
0 0 0 1 x x x x
0 0 1 0 x x x x
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
1 1 0 1 x x x x
1 1 1 0 x x x x
1 1 1 1 x x x x
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:

You might also like