On Tue, Oct 24, 2006 at 03:48:59PM -0400, Jeff Woods wrote: > They represent the boundaries of the size of the FFT (Fast Fourier > Transforms) lookup tables used to do the gargantuan divisions that would > otherwise be impossible in a reasonable time.
First: You probably mean multiplications, not divisions. Second: The FFT is not a lookup table. Sure, it uses lookup tables (that probably grow with the FFT length), but it is not primarily a lookup table. It's a transformation that enables you to move your data into a form where squaring is incredibly much simpler, and then back to round off. /* Steinar */ - who was been on the list for almost ten years now, and still doesn't understand the magical trick to halve the FFT length :-/ -- Homepage: http://www.sesse.net/ _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
