??? 05/14/08 20:35 Read: times |
#154779 - the step size dependacy makes its problematic Responding to: ???'s previous message |
For each distance that the device moves, one bit change yields a visual movement that is very noticeable. A byte range of 0x00 to 0x80 is controlling a step range of 0x00 to 0x928 as a long. So that 928 is divided by 0x80 for each step across that range. So a change in the input yields a pretty noticable change on the output. These limits are imposed by the device and I have no control over how to divide it up. So I'm trying to avoid the "hunting" problem due to this limitation. I agree that its hard to control such a small change, but the device I'm going up against seems to be able to do it with grace, so I know its doable....just have to be smarter on how to get to a to b....so here I am. |
Topic | Author | Date |
Sort array data elements? | 01/01/70 00:00 | |
Sort and Search? | 01/01/70 00:00 | |
Neil..... | 01/01/70 00:00 | |
64 samples is big for a median filter ... | 01/01/70 00:00 | |
No I haven't.....only because | 01/01/70 00:00 | |
Google for "sorting algorithms" | 01/01/70 00:00 | |
Ok, first things first then. | 01/01/70 00:00 | |
The MPU and LDO are all in order | 01/01/70 00:00 | |
Quantization error ? | 01/01/70 00:00 | |
the step size dependacy makes its problematic | 01/01/70 00:00 | |
Sorts![]() | 01/01/70 00:00 | |
??? | 01/01/70 00:00 | |
Couldn't sort it... | 01/01/70 00:00 |