Timeline for Efficient inverse (1/x) for AVR
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2010 at 23:34 | comment | added | Peter Gibson | I tried something similar in summing the divisor until it equals or exceeds the dividend, but found it to be fairly slow. It looks like the LUT will be the way to go - using avr-gcc you need special macros in <avr/progmem.h> to store it in flash. | |
| Sep 13, 2010 at 18:06 | history | answered | ajs410 | CC BY-SA 2.5 |