Conversion From Gray Code To Binary Code and Vice Versa A015d46a
Conversion From Gray Code To Binary Code and Vice Versa A015d46a
Let Gray Code be g3 g2 g1 g0. Then the respective Binary Code can be obtained as follows:
1|P ag e
i.e.
b3 = g 3
b2 = b3 ⊕ g2
b1 = b2 ⊕ g1
b0 = b 1 ⊕ g 0
Example:
b3 = g 3 = 1
b2 = b3 ⊕ g2 = 1 ⊕ 0 = 1
b1 = b2 ⊕ g1 = 1 ⊕ 0 = 1
b0 = b1 ⊕ g0 =1 ⊕ 1 = 0
2|P ag e
∴ Final Binary Code: 1 1 1 0
Let Binary code be b3 b2 b1 b0. Then the respective Gray Code can be obtained is as
follows
i.e.
g3 = b3
g2 = b3 ⊕ b2
g1 = b2 ⊕ b1
g0 = b1 ⊕ b0
Example:
3|P ag e
g3 = b3 = 1
g2 = b3 ⊕ b2 = 1 ⊕ 1 = 0
g1 = b2 ⊕ b1 = 1 ⊕ 1 = 0
g0 = b1 ⊕ b0 =1 ⊕ 0 = 1
Liked this article on Conversion from Gray Code to Binary Code and Vice Versa? Let us
know in the comments! Here are more articles that you may like –
Partial Differentiation
Mean Value Theorem
Differentiation
Limits Continuity & Differentiability
Laplace transform
State Space Analysis
Designing and Tuning in Control Systems
Time signal transformation
Vector integration
Vector calculus
Integration
Maxima & Minima
For more information on GATE 2019, you can click the links given below
Time Management Tips for GATE GATE 2019 Exam Schedule Out
2019
GATE Virtual Calculator 2019 PSUs Recruitment Through GATE
2019
5|P ag e