Larry Troxler wrote:

..some helpful, insightful stuff, then questions himself, saying

>perhaps not, especially given that the implementation of a Sinc
interpolation
>might need to involve a second table lookup to efficiently compute the
sinc function!

Well, absolutely, you need the second lookup...
but the second lookup still is much faster even though
you will still have to window the Sinc interpolation function, anyway...
 as  to polynomial interpolation.. as I understand it
(and you evidently also opine) the polynomial calculation expense grows
quite
high for orders that produce useful results, and if you can afford the
memory 'cost' of large table size & the sinc  & window tables for
filtering,
you can easily beat polynomial interpolation. In fact , I don't even think
the
sinc 'filter' has to be that many points, although again to get enough
'resolution'
in the appropriatly sampled sinc func, you should use a large enough sinc
function
or use some sort or (usually linear ;) ) interpolation in reading the sinc
function!
And still, I understand this algorithm clocks out faster than equivalently
clean
polynomial interpolation algorithms!!

charlieb