??? 09/29/08 02:07 Read: times |
#158636 - huge table Responding to: ???'s previous message |
I hope you where not planning on having a 24 bit lookup table - such a table would have about 16 million entries, where each entry is three bytes large...
A lookup table may be great if you have a 4-bit or 6-bit encoder. The lookup table will be smaller than the code to compute the conversion for low bit counts. Take a pen and paper and fill one column of a table with binary numbers and another with gray numbers. If you look at it for a while - possibly playing a bit with some C code - you should see that it is quite easy to convert between gray and binary. When you understand how to do it in C, it will be uite easy (if you are fluent in assembler for the specific processor) to create an assembler routine. |
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 |