I've been doing some more work on the FFT. I found a way to get around writing more new butterflies for the FFT. So now I have the FFT working for power of two lengths.
The times are quite good but can be improved yet. Firstly MPIR just uses mpn_mul_n to do pointwise mults in the FFT range. I'm just using that at present because I don't have an optimised Nussbaumer convolution. But that can be improved considerably. Secondly I have not optimised the first layer of the FFT and the last layer of the FFT for cache friendliness. Anyhow, even with these two problems it is still beating MPIR right up to 4Gbit integers. More to do yet. Bill. -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com. To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
