Il 13.12.2010 10:09, Malcolm McLean ha scritto:

> On Dec 13, 6:55 am, George Neuner<(E-Mail Removed)> wrote:

>>

>> But the point of table lookup in any algorithm is to have part of the

>> answer precomputed. If the entire calculation can be done

>> sufficiently quickly, precomputing becomes unnecessary.

>>

> Suppose we have a table of 100 values representing sine wave. We have

> theta in a floating point.

>

> By taking theta/2PI * 100 we can create an index into the sine table.

> However this calculation isn't inherently integeral.

> If we linearly interpolate between floor(theta/PI *100) and ceil(theta/

> 2PI * 100) we can get slightly more accurate results. If the hardware

> does it automatically for us, we can get the results very quickly.

>

>

>

>
Wow, that's quite unknown to me the whole! I'll guess

it is a good way to draw abstract mathe near to a practical use,

because of the "naturality" of fp values.

Could someone among you provide asm/C reference sample source code to

study ?

BTW, i was wondering about the fractional part such as a method

to reindex colliding hash values.

Regards,

--

..::mrk::.

x64 Assembly Lab

http://sites.google.com/site/x64lab