- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

The reflected binary code or Gray code is an ordering of the binary numeral system such that two successive values differ in only one bit (binary digit). Gray codes are very useful in the normal sequence of binary numbers generated by the hardware that may cause an error or ambiguity during the transition from one number to the next. So, the Gray code can eliminate this problem easily since only one bit changes its value during any transition between two numbers.

Gray codes are used in rotary and optical encoders, Karnaugh maps, and error detection. The hamming distance of two neighbours Gray codes is always 1 and also first Gray code and last Gray code also has Hamming distance is always 1, so it is also called *Cyclic codes*. You can convert a Gray code to Binary number using two methods.

**Using Karnaugh (K) - map** −

You can construct Gray codes using other methods but they may not be performed in parallel like given above method. For example, 3 bit Gray codes can be contracted using K-map which is given as following below:

Decimal | Gray Code | Binary |
---|---|---|

0 | 000 | 000 |

1 | 001 | 001 |

2 | 011 | 010 |

3 | 010 | 011 |

4 | 110 | 100 |

5 | 111 | 101 |

6 | 101 | 110 |

7 | 100 | 111 |

**Using Exclusive-Or (**⊕**) operation** −

This is very simple method to get Binary number from Gray code. These are following steps for *n*-bit binary numbers −

- The Most Significant Bit (MSB) of the binary code is always equal to the MSB of the given binary number.
- Other bits of the output binary code can be obtained by checking gray code bit at that index. If current gray code bit is 0, then copy previous binary code bit, else copy invert of previous binary code bit.

For example, for 3-bit binary number, let Binary digits are b_{2} , b_{1} , b_{0}, where b_{2} is the most significant bit (MSB) and b_{0} is the least significant bit (LSB) of Binary. Gray code digits are g_{2} , g_{1} , g_{0}, where g_{2} is the most significant bit (MSB) and g_{0} is the least significant bit (LSB) of Gray code.

Gray Code g _{2}g_{1}g_{0} | Binary b _{2}b_{1}b_{0} |
---|---|

000 | 000 |

001 | 001 |

011 | 010 |

010 | 011 |

110 | 100 |

111 | 101 |

101 | 110 |

100 | 111 |

Therefore, you solve boolean expression using k-map, you will get b_{2}=g_{2}, b_{1}=g_{1}⊕g_{2}, and b_{0}=g_{0}⊕g_{1}⊕g_{2}.

Similarly, you can convert n-bit (b_{n}b_{(n-1)}...b_{2}b_{1}b_{0}) Binary number into Gray code (g_{n}g_{(n-1)}...g_{2}g_{1}g_{0}). For least significant bit (LSB) b_{n}=g_{n}, b_{(n-1)}=g_{(n-1)}⊕g_{n}, …. b_{1}=g_{1}⊕g_{2}⊕g_{3}...⊕g_{n} and b_{0}=g_{0}⊕g_{1}⊕g_{2}⊕g_{3}...⊕g_{n}.

**Example** − Convert Gray code 100111 into Binary number.

So, according above algorithm,

b_{5}=g_{5}=1=1

b_{4}=g_{5}⊕g_{4} =1⊕0 =1

b_{3}=b_{4}⊕g_{3} =1⊕0 =1

b_{2}=b_{3}⊕g_{2} =1⊕1 =0

b_{1}=b_{2}⊕g_{1} =0⊕1 =1

b_{0}=b_{1}⊕g_{0} =1⊕1 =0

So, Binary number will be 111010.

- Related Questions & Answers
- Conversion of Binary to Gray Code
- Python Program to Convert Gray Code to Binary
- Python Program to Convert Binary to Gray Code
- Binary to Gray code using recursion in C program
- What is Gray code?
- Gray Code in C++
- Decimal to Binary conversion
- 8085 program to convert gray to binary
- 8085 program to convert binary numbers to gray
- Binary to BCD conversion in 8051
- BCD to binary conversion in 8051
- Binary Tree to Binary Search Tree Conversion in C++
- Program to convert gray code for a given number in python
- 8085 code to convert binary number to ASCII code
- C Program for Decimal to Binary Conversion?

Advertisements