??? 12/07/04 22:21 Read: times |
#82727 - Yes, that's better Responding to: ???'s previous message |
I think I have got a better way. If I increase my table to 32 16 bit numbers, then I can just rotate the entire 24 bit sum to the left 3 bits, and drop the low byte. Yes, definitely. Often it is easier to adjust your algorithm to use a number of samples/numbers such that it is evenly divisible by two. In those cases you can use the rotate instructions to do the division for you quickly and simply. It's easy to get stuck on trying to figure out how to "brute force it" when the better solution is actually to rethink the problem and find an approach that is more appropriate for the 8-bit architecture we're working on. Regards, Craig Steiner |
Topic | Author | Date |
24bit /8bit long division | 01/01/70 00:00 | |
24bit /8bit long division | 01/01/70 00:00 | |
How about rotate left? | 01/01/70 00:00 | |
multibyte rotate | 01/01/70 00:00 | |
Compact code | 01/01/70 00:00 | |
Rotate in hardware.![]() | 01/01/70 00:00 | |
Yes, that's better | 01/01/70 00:00 | |
Some other suggestions | 01/01/70 00:00 |