Strange Gray Code - Efficient Decoding

Question

I am trying to figure out an efficient way to go from a strange Gray code to either Binary Reflected Gray Code or to normal binary.

The pattern goes:
000000
000001
000101
000100
000110
000111
010111
010110
010100
010101
010001
010000
010010
010011
011011
011010
011000
011001
001101
011100
011110
011111
1011111
1011110
1011100
1011101
and so on...

it uses up to 12 bits.

score 0 · Answer 1 · edited Apr 16 '20 at 13:12

0

Array string in [ "00001", "000011, ... etc.
Array string out [ "01" , "10" , ...

Loop through an array to find a match, use same index in other array for conversion.

Might also be nice to try conversion with a neural network; after a while it will convert it. Actually that's I think nice try, have you somewhere the full gray binary list?

Perhaps I like to give it a try in a yet to build neural network.

edited Apr 16 '20 at 13:12

halfer

19,824
17
99
186

answered Jul 12 '12 at 13:58

user613326

2,140
9
34
63

I do have the entire gray binary list. I saved all the values as decimal in a .txt file (http://www.megafileupload.com/en/file/360277/GrayCode-txt.html) I am not familiar at all with neural networks. – mike29892 Jul 12 '12 at 14:11

score 0 · Answer 2 · answered Jul 12 '12 at 15:02

0

The most efficient method would be to use a dictionary/hash table. Alternatively, store them sorted in an array and use a binary search.

[EDIT]

Actually, now I think about it, a lookup table of 4096 entries wouldn't occupy that much space by today's standards.

answered Jul 12 '12 at 15:02

MRAB

20,356
6
40
33

I was trying to avoid a table look up, I am actually fairly limited on space. – mike29892 Jul 12 '12 at 15:22

Strange Gray Code - Efficient Decoding

2 Answers2