Re: Fast SH squaring

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


------------------------------------------------------------------------------
Come build with us! The BlackBerry(R) Developer Conference in SF, CA
is the only developer event you need to attend this year. Jumpstart your
developing skills, take BlackBerry mobile applications to market and stay 
ahead of the curve. Join us from November 9 - 12, 2009. Register now!
http://p.sf.net/sfu/devconference
_______________________________________________
GDAlgorithms-list mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list