EXPERIMENT: 2 a) BINARY TO GRAY CODE CONVERTER
AIM: To realize Binary to Gray code converter and
vice versa.
LEARNING OBJECTIVE:
▪ To
learn the importance of non-weighted code
▪ To
learn to generate gray code COMPONENTS REQUIRED:
IC 7400, IC 7486, and IC 7408,
Patch Cords & IC Trainer Kit
Binary
|
Gray
|
||||||
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
|
0
|
0
|
1
|
1
|
|
0
|
0
|
1
|
1
|
|
0
|
0
|
1
|
1
|
|
0
|
0
|
1
|
1
|
|
|
|
0
|
1
|
|
0
|
1
|
|
0
|
1
|
|
0
|
1
|
|
0
|
1
|
|
0
|
1
|
|
0
|
1
|
|
0
|
1
|
|
|
|
0
|
|
1
|
|
0
|
1
|
|
||||
0
|
|
1
|
|
0
|
1
|
|
||||
|
||||||||||
|
1
|
|
0
|
|
1
|
|
0
|
|||
|
1
|
|
0
|
|
1
|
|
0
|
|||
|
|
|
iv) G0=B1 Å B0
0
|
0
|
0
|
0
|
|
1
|
1
|
1
|
1
|
|
0
|
0
|
0
|
0
|
|
1
|
1
|
1
|
1
|
|
|
|
|
|
Logic Realization:
PROCEDURE:
·
Check all the components for their working.
·
Insert the appropriate IC into the IC base.
·
Make connections as shown in the circuit diagram.
·
Verify the Truth Table and observe the outputs.
RESULT: Binary
to gray code conversion and vice versa is realized using EX-OR gates and NAND
gates.
VIVA QUESTIONS:
1) What are
code converters?
2) What is the
necessity of code conversions?
3) What is
gray code?
4) Realize the
Boolean expressions for
a) Binary
to gray code conversion
b) Gray to
binary code conversion
0 comments:
Post a Comment