??? 08/18/06 01:45 Read: times |
#122525 - Another source Responding to: ???'s previous message |
Erik Malund said:
Jack Ganssle had recently a column (was it two) on fast approximations, and I tend to recall square root was there too. I think May.June timeframe in embedded systems magazine http://www.embedded.com
Those who are interested might want to check out Math Toolkit for Real-Time Programming by Jack Crenshaw (ISBN 1-929629-09-5). The CDROM that comes with the book doesn't contain much (it could have been put on a floppy disk), so don't expect to cut and paste much code. But then the purpose of the book is to teach you how to write fast numerical routines for small processors, which is much more valuable that just providing routines to use without understanding them. |
Topic | Author | Date |
Things you find ... | 01/01/70 00:00 | |
10 lines PLUS a whole bunch of 'lines' | 01/01/70 00:00 | |
I forgot to mention ... | 01/01/70 00:00 | |
sounds reasonable | 01/01/70 00:00 | |
I'll optimize it tomorrow. | 01/01/70 00:00 | |
haven't heard of that one | 01/01/70 00:00 | |
Do it using the RLC instruction. | 01/01/70 00:00 | |
Optimized results: | 01/01/70 00:00 | |
how does the lookup table approach time | 01/01/70 00:00 | |
Comparison: | 01/01/70 00:00 | |
Table error | 01/01/70 00:00 | |
No error. | 01/01/70 00:00 | |
So how did you calculate/measure the average? | 01/01/70 00:00 | |
Right below the table: | 01/01/70 00:00 | |
I do the same thing | 01/01/70 00:00 | |
Lookup table will win hands down | 01/01/70 00:00 | |
For floats, yes. For long ints ... not so sure. | 01/01/70 00:00 | |
one more thing | 01/01/70 00:00 | |
if the precision is not 'critical' | 01/01/70 00:00 | |
Another source | 01/01/70 00:00 | |
What about a Hardware Solution? | 01/01/70 00:00 |