| ??? 04/29/09 07:54 Read: times |
#164925 - Having a hard time trying to understand :( Responding to: ???'s previous message |
Having a hard time trying to understand the examples and algorithms you posted. But still trying.
I was wanting to deal with 512 variables, but this is far to be possible because of 8051 ram, 256 also, 128 too, maybe 64 values, so I need to use the less memory possible. Is possible to do with just two bytes of ram for each value? I was thinking something like the following: A ram byte to be step number, every step it is decreased V1 = V1 - [ (V1 - V1end) / StepN ] Dec StepN Repeat IE: 100 to 0 in 4 steps Step1: 100 / 4 = 25 | V1 = 100 - 25 = 75 Step2: 75 / 3 = 25 | V1 = 75 - 25 = 50 Step3: 50 / 2 = 25 | V1 = 50 - 25 = 25 Step4: 25 / 1 = 25 | V1 = 25 - 25 = 0 |
| Topic | Author | Date |
| Values interpolation | 01/01/70 00:00 | |
| A possible start | 01/01/70 00:00 | |
| The Brezingham Line Drawing algorithm | 01/01/70 00:00 | |
| http://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm ? | 01/01/70 00:00 | |
| Good method | 01/01/70 00:00 | |
| Integer Digital Differential Analyzer | 01/01/70 00:00 | |
| Simple scheme... | 01/01/70 00:00 | |
| Further optimization | 01/01/70 00:00 | |
| You are absolutely right, of course,... | 01/01/70 00:00 | |
| Having a hard time trying to understand :( | 01/01/70 00:00 | |
| Clarification Needed | 01/01/70 00:00 | |
| Even more confused now | 01/01/70 00:00 | |
| Another Shot | 01/01/70 00:00 | |
| code | 01/01/70 00:00 | |
| Provided Code | 01/01/70 00:00 | |
| Maybe this | 01/01/70 00:00 | |
Give this a try... | 01/01/70 00:00 | |
| Look it up | 01/01/70 00:00 | |
| Now, we have a hard time to understand... | 01/01/70 00:00 |