Who invented gray code

More specifically we can say, it is a binary number system where while moving from one step to the next, only a single bit shows variation. It is also termed as reflected binary code or cyclic code. It is an unweighted code, as here like other number systems, no particular weight is provided to various bit positions. Basically, binary code is changed to gray equivalent in order to lessen the switching operations. As only a single bit is changed at a particular time duration this leads to a reduction in switching from one bit to another.

Let us have a look at the tabular representation, showing gray value for different binary values:. Thus we can conclude that in a binary system, all 4 bits are getting changed simultaneously. Hence we can say multiple bits are changing at the same time. So, here we can see that only a single bit i. This shows that in binary coding, multiple bits are changing simultaneously, while in gray coding only a single bit is getting change at a time to move from one value to another.

Now, the question arises, how can we achieve, a gray equivalent from a binary code or vice versa. This is simpler method to contract Gray code of n-bit Binary numbers. Each bit is inverted if the next higher bit of the input value is set to one. 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 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:. What is Gray code? George John. Previous Page Print Page. Next Page.