Oh, that's a happy little question! To convert gray code to binary, you can start by writing down the first bit as it is. Then, for each subsequent bit, you can add the gray code bit to the binary bit before it. So, for 10101111, the binary equivalent would be 11101010. Just remember, there are no mistakes, only happy little accidents!
To convert Gray code to binary code you must be familiar with the logical XOR operator. XOR outputs a 1 bit if either of two input bits is 1, but not both. The truth table for XOR, for all possible inputs p and q, is as follows:
p q output
0 0 0
0 1 1
1 0 1
1 1 0
The algorithm to convert from Gray code to binary code is as follows:
Step 1: Fix the most-significant bit, the MSB, which is always the same for both codes. If there are no more bits, we're done, otherwise proceed to step 2.
Step 2: XOR the most recently fixed binary bit with the next available Gray bit. Fix the result as the next binary bit.
Step 3: If there is at least one more Gray bit available, go to step 2. Otherwise we're done.
Therefore, to convert 10101111 from Gray to binary, we proceed as follows:
Gray = 10101111
Fix MSB = 1
1 XOR 0 = 1
1 XOR 1 = 0
0 XOR 0 = 0
0 XOR 1 = 1
1 XOR 1 = 0
0 XOR 1 = 1
1 XOR 1 = 1
Thus: Binary = 11010101
Note that we carry the fixed bit (the bold bit) onto the next line as the l-value (left operand) of XOR. The r-value (right operand) of XOR is always the next available Gray bit after the MSB. Reading the fixed bits from top to bottom reveals the binary code.
We can also write this as follows:
Gray = 10101111
Binary = 1 XOR 0 = 1 XOR 1 = 0 XOR 0 = 0 XOR 1 = 1 XOR 1 = 0 XOR 1 = 1 XOR 1 = 1
Reading the fixed (bold) bits left to right reveals the binary code.
I do not believe that is a valid binary number. All binary numbers must be divisible by 8
The opposite to gray is gray dark gray is light gray ;)
Gray?
gray
Platinum or gray
The best way is with a lookup table.
The Gray Code is a type of binary code developed by a programmer named Frank Gray. Gray code is a binary numeral system that differ than normal binary code, and is used widely to detect errors in software.
The reflected binary code, also known as Gray codeafter Frank Gray, is a binary numeral system where two successive values differ in only one bit.Here is an example of a 4-bit Gray code:0000000100110010011001110101010011001101111111101010101110011000
Converting Gray Code to Binary1). Write down the number in gray code.2). The most significant bit of the binary number is the most significant bitof the gray code.3). Add (using modulo 2) the next significant bit of the binary number to thenext significant bit of the gray coded number to obtain the next binary bit.4). Repeat step 3 till all bits of the gray coded number have been added inmodulo 2. The resultant number is the binary equivalent of the gray number.Converting Binary to Gray Code1). Write down the number in binary code.2). The most significant bit of the gray number is the most significant bitof the binary code.3). Add (using modulo 2) the next significant bit of the binary number to thenext significant bit of the binary number to obtain the next gray coded bit.4). Repeat step 3 till all bits of the binary coded number have been added inmodulo 2. The resultant number is the gray coded equivalent of the binarynumber.
gray code is one which changes one bit at a time but binary code is one which changes one or more bit at a time. for example three bit binary and gray code the left one is binary and the right one is gray code.binary gray000 000001 001010 011011 010100 110101 111110 101111 100000 000
Gray Code is Reflective Binary code. One of the main disadvantages of Gray code is that it is very difficult to come up with an arithmetic logic unit to support Gray code.
characteristic of Gray code
gray code is one which changes one bit at a time but binary code is one which changes one or more bit at a time. for example three bit binary and gray code the left one is binary and the right one is gray code.binary gray000 000001 001010 011011 010100 110101 111110 101111 100000 000
help PLA use convert excess-3 to gray code
It can be implemented very easily .... Suppose the Binary word is X7X6X5.... X0 then the corresponding Gray code is G7G6G5....G0 where G7=X7 G6=X7 XOR X6 G5=X6 XOR X5 ..... G0=X1 XOR X0 Now implement the above algorithm
I do not believe that is a valid binary number. All binary numbers must be divisible by 8
BCD codes,gray code,error detecting code,ASCII character code,Excess 3 code