1. Using Karnaugh maps get simplified expressions for each binary bit as a function of gray code bits. Verify the circuit given in Fig. I with your Boolean expressions.
Table 1. Truth Table of Gray to Binary Code Converter
Gray Code G3 G2 G1 GO
Binary Code
B2
B1 B0
G.
G
Figure1