Binary to Gray code formula

First give the formula for converting binary code to Gray code, as shown below (in the following formula, both binary code and Gray code are n-bit):

g[n-1]=b[n-1], g[i]=b[i]^b[i 1], i=[0,1,...,n-2]

Binary code----》Gray code (encoding):

Starting from the rightmost digit, XOR each bit with the left digit in sequence as the corresponding Gray code The value of this bit, the leftmost bit remains unchanged (equivalent to the left side being 0).

The characteristics of Gray code are:

In the Gray code of two adjacent numbers, only one binary digit changes.

And only one binary digit changes in the minimum and maximum values ​​within its range.

Gray Code has used names such as Gray Code, Gray Code, Gray Code, Golay Code, Cyclic Code, Reflected Binary Code, Minimum Error Code, etc. Some of them are wrong; It is easy to be confused with other names. It is recommended not to use these previous names.

The above is the detailed content of Binary to Gray code formula. For more information, please follow other related articles on the PHP Chinese website!