RosettaCodeData/Task/Gray-code/00DESCRIPTION

29 lines
1.2 KiB
Text
Raw Permalink Normal View History

2015-11-18 06:14:39 +00:00
[[wp:Gray code|Gray code]] is a form of binary encoding where transitions between consecutive numbers differ by only one bit. This is a useful encoding for reducing hardware data hazards with values that change rapidly and/or connect to slower hardware as inputs. It is also useful for generating inputs for [[wp:Karnaugh map|Karnaugh maps]] in order from left to right or top to bottom.
2013-04-10 21:29:02 -07:00
2015-02-20 00:35:01 -05:00
Create functions to encode a number to and decode a number from Gray code.
2013-04-10 21:29:02 -07:00
2015-11-18 06:14:39 +00:00
Display the normal binary representations, Gray code representations, and decoded Gray code values for all 5-bit binary numbers (0-31 inclusive, leading 0's not necessary).
There are many possible Gray codes. The following encodes what is called "binary reflected Gray code."
2013-04-10 21:29:02 -07:00
Encoding (MSB is bit 0, b is binary, g is Gray code):
2015-11-18 06:14:39 +00:00
2013-04-10 21:29:02 -07:00
<pre>if b[i-1] = 1
g[i] = not b[i]
else
g[i] = b[i]</pre>
2015-11-18 06:14:39 +00:00
2013-04-10 21:29:02 -07:00
Or:
2015-11-18 06:14:39 +00:00
2013-04-10 21:29:02 -07:00
<pre>g = b xor (b logically right shifted 1 time)</pre>
2015-11-18 06:14:39 +00:00
2013-04-10 21:29:02 -07:00
Decoding (MSB is bit 0, b is binary, g is Gray code):
2015-11-18 06:14:39 +00:00
2013-04-10 21:29:02 -07:00
<pre>b[0] = g[0]
for other bits:
b[i] = g[i] xor b[i-1]</pre>
;Reference
* [http://www.wisc-online.com/Objects/ViewObject.aspx?ID=IAU8307 Converting Between Gray and Binary Codes]. It includes step-by-step animations.