You are right. I think it won't be in GMP 4.3. But there is nothing stopping us putting it into eMPIRe.
We can test against the FLINT FFT to make sure it gives correct results. That has already been done at various points as Paul and I were in contact about the respective FFT's, but we can do it again for ourselves. Bill. 2008/11/26 mabshoff <[EMAIL PROTECTED]>: > > On Nov 26, 11:09 am, "Bill Hart" <[EMAIL PROTECTED]> wrote: > > Hi Bill, > >> Cool! >> >> Paul Zimmermann, Pierrick Gaudry and Alexander Krupka (and possibly >> also Torbjorn Granlund) worked on a new FFT for GMP. It is comparable >> with the one in FLINT and uses Fermat numbers and Mersenne numbers I >> think. >> >> Also I think Torbjorn Granlund and Alexander Krupka worked on an FFT >> (perhaps a small prime FFT?) which is fast for very large operands. I >> have never seen the code or performance figures so I don't know all >> that much about this. I might just have this mixed up with the >> Zimmermann one. >> >> There is an improved fft patch on the gmp website which appears to be >> written by Paul Zimmermann, but it contains the following lines: >> >> "TODO: >> >> Implement some of the tricks published at ISSAC'2007 by Gaudry, Kruppa, >> and >> Zimmermann." >> >> The patch has also been relicensed GPL v3+ which is odd considering >> that wasn't around in 2007 and there is no indication of changes to >> the patch since then. >> >> There are plans to dramatically improve the FFT in eMPIRe. But we need >> to discuss the best strategy for that. Licensing is an issue. >> >> Looking at Paul Zimmermann's website there is an fft-mul patch which >> claims to be up to 2 times faster than the fft distributed with GMP. >> This appears to have been written by TG, PZ, AK and PG. >> >> We could just plug that straight in to eMPIRe. It is licensed LGPL >> v2.1+ and wouldn't need merging. I very much doubt Paul would change >> the license on that, but I've retrieved a version under LGPL v2.1+ >> anyhow. >> >> I know the FLINT one is faster again for small operands and >> occasionally for larger operands, but there is so much work to merge >> it, and it would be GPL only that I think we should avoid wasting our >> time for now. The original idea was for the Zimmermann et al FFT to >> end up in GMP and the FLINT one to end up in eMPIRe, but now I think >> we could save ourselves a lot of work by just using the Zimmermann et >> al one. >> >> Almost certainly we could improve the Zimmermann et al FFT using some >> of the tricks from FLINT. >> >> What does everyone think? > > It looks like the easiest way to get a fast LGPL V2 compatible FFT > into eMPIRe, so I am +1 on this. But I am more than a little surprised > that the FFT is allegedly going into gmp 4.3 since that seems like a > major piece of code to me. As you mentioned below there seem to be > improvements by TG for various bits relative to Paul's FFT code, but > you are an expert there too. I obviously cannot contribute here > directly due to lack of knowledge :(. > >> Bill. > > Cheers, > > Michael > > > --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
