??? 01/16/06 11:17 Read: times |
#107473 - Yeah, but Responding to: ???'s previous message |
Yeah, but you can do a single byte tan lookup in a 256 byte look up table in microseconds. That's way smaller and faster than any other method proposed so far.
Ian |
Topic | Author | Date |
tangent function | 01/01/70 00:00 | |
Tangent function | 01/01/70 00:00 | |
here | 01/01/70 00:00 | |
tangent function | 01/01/70 00:00 | |
Ah, but | 01/01/70 00:00 | |
and why cannot you | 01/01/70 00:00 | |
or use SDCC | 01/01/70 00:00 | |
Yes but.. | 01/01/70 00:00 | |
CORDIC | 01/01/70 00:00 | |
Possibly useful.... | 01/01/70 00:00 | |
Yeah, but | 01/01/70 00:00 | |
tangent function | 01/01/70 00:00 | |
Requirements | 01/01/70 00:00 | |
tangent function | 01/01/70 00:00 | |
Position | 01/01/70 00:00 | |
tangent function | 01/01/70 00:00 | |
example of an answer | 01/01/70 00:00 | |
Do you understand this? | 01/01/70 00:00 | |
More Questions | 01/01/70 00:00 | |
sin/cos approximations | 01/01/70 00:00 | |
Sine etc look up tables | 01/01/70 00:00 | |
options | 01/01/70 00:00 | |
Nasty function![]() | 01/01/70 00:00 |