??? 09/29/08 20:54 Read: times |
#158659 - Algorithm Responding to: ???'s previous message |
I found this at
http://www.edaboard.com/viewtopic...+gray+grey Binary --> Gray G{N-1} = B{N-1} G{i} = b {i+1} XOR b {i} Gray --> Binary B{N-1} = G{N-1} B{i} = b{i+1} xor G{i} N-1>i>=0 The curly brackets should be square brackets, but it somehow interferes with the HTML. -Aubrey |
Topic | Author | Date |
Gray Code To Binary 8051 | 01/01/70 00:00 | |
huge table | 01/01/70 00:00 | |
RE: Take a pen and paper | 01/01/70 00:00 | |
Here are a few places to look... | 01/01/70 00:00 | |
What for? | 01/01/70 00:00 | |
Algorithm | 01/01/70 00:00 | |
Gray Code To Binary 8051 | 01/01/70 00:00 | |
Post it | 01/01/70 00:00 | |
Yes! | 01/01/70 00:00 | |
Shifting ? | 01/01/70 00:00 | |
Gray Code To Binary 8051 | 01/01/70 00:00 | |
Posting times | 01/01/70 00:00 | |
Gray Code To Binary 8051 | 01/01/70 00:00 | |
2^n - 1 is not fast for large n | 01/01/70 00:00 | |
Ouch | 01/01/70 00:00 | |
Gray Code To Binary 8051 | 01/01/70 00:00 | |
hardware | 01/01/70 00:00 | |
gray to bin | 01/01/70 00:00 | |
asm | 01/01/70 00:00 | |
Gray Code To Binary 8051![]() | 01/01/70 00:00 |