Paul van Grieken asked on 21 Oct 1999 at 17:16 h
> Why is there a difference in iteration time between the LL test and a
> double test.
For the same FFT-size, the double checking code has to perform a bit
extra work per iteration:
it multiplies by 2 before the DWT, and divides by 4 afterward. This
guarantees totally different data during the convolutions.
This allows to use the same starting value L[1], thus generating (if
nothing went wrong in the hardware) the same residue as the first test.
(This is a translation of my reply in Dutch to Paul van Grieken)
How much slower (in percentage) does this make double checking compared
to a first-time LL test?
Robert van der Peijl <[EMAIL PROTECTED]>
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
