Update on 8014320
tbuktu at hotmail.com
Fri Jan 3 17:23:47 UTC 2014
> On Dec 23, 2013, at 11:37 AM, Tim Buktu wrote:
>> * Compact storage of DFT vectors. At the moment, they are stored as
>> numbers modulo 2^2^(n+1) when (2^2^n)+1 would suffice. This will save
>> memory and may speed up the DFT and IDFT steps.
It did indeed improve performance. The latest patched BigInteger.java is at
>> * Maybe add a multiplyParallel() method, now that dft() and idft() use
>> Bailey's algorithm which should make them easy to parallelize.
I checked an initial implementation into a separate Git branch:
More information about the core-libs-dev