Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • Thank you for your response. I'm a little confused, once you get the "converted" value for one of the bits, what do you do for the remainder of the bits? Commented Nov 23, 2015 at 14:52
  • 1
    In the example "lkup[wk]" IS the new VALUE of the converted byte.... therefore, there are NO leftover bits... This example requires YOU to determine the "converted" byte for each of the 256 possible values of a byte. This methodology provides the fastest converstion... ckruczek's answer above will not force YOU to perform the bit swapping to come up with the answer, but it is probably slower (although probably not by a very much). But since this is probably an assignment, having you perform the calculations will probably be a good exercise. Commented Nov 23, 2015 at 20:09
  • I like this way I just do not understand how look up tables work. Sorry, I'm very new to bit manipulation. ie: why did you choose those values for the table? Commented Nov 24, 2015 at 2:20