Re: [Algorithms] Fast SH squaring

[<chr...@pl...>]

Ben Yeoh wrote:

> There's one paragraph however where it's mentioned that "SH squares
> are also cheaper than general SH products" (ie, computing F * F is
> more efficient than F * G), but which is not elaborated on. Sadly,
> the details are not immediately obvious to me. Can someone shed some
> light on how and why? Apparently, this is efficient enough to
> compute in the GPU (unlike a general SH triple product).

Googling for "sh squaring"

http://www.google.com/search?hl=en&ie=UTF-8&q=%22sh+squaring%22&btnG=Search

returns exactly ONE hit.


Christer Ericson, Director of Tools and Technology
Sony Computer Entertainment, Santa Monica