I have finally managed to implement the truncated sqrt2 transforms and
the matrix fourier sqrt2 transforms. This enables me to get actual
timings vs mpir. These times for multiplying two integers of the given
numbers of bits.
On my machine the mpir FFT starts beating toom algorithms at about
16000
Hi all,
I've been working away at this new FFT I've been writing (for 2 years).
There's a multitude of functions, FFT, IFFT, truncated FFT and IFFT,
matrix fourier algorithm FFT and IFFT and truncated matrix fourier
algorithm FFT and IFFT.
Each of these needs a new version which handles the sqrt
