101111001 from Binary to Gray Code
Converting a binary number to Gray code involves performing a bitwise exclusive OR (XOR) operation between each pair of adjacent bits in the binary representation. Here's a step-by-step guide with an example for binary number 101111001:
Write down the first bit of the Gray code as the same as the first bit of the binary number.
FIRST BIT OF GRAY CODE: 1
The 1st bit is 1, and the 2nd bit is 0. Both the bits are different, so the second bit of the Gray code is 1.
The 2nd bit is 0, and the 3rd bit is 1. Both the bits are different, so the third bit of the Gray code is 1.
The 3rd bit is 1, and the 4th bit is 1. These bits are the same, so the fourth bit of the Gray code is 0.
The 4th bit is 1, and the 5th bit is 1. These bits are the same, so the fifth bit of the Gray code is 0.
The 5th bit is 1, and the 6th bit is 1. These bits are the same, so the sixth bit of the Gray code is 0.
The 6th bit is 1, and the 7th bit is 0. Both the bits are different, so the seventh bit of the Gray code is 1.
The 7th bit is 0, and the 8th bit is 0. These bits are the same, so the eighth bit of the Gray code is 0.
The 8th bit is 0, and the 9th bit is 1. Both the bits are different, so the ninth bit of the Gray code is 1.