Quote from the "Math" page
<<
There is another error check that is fairly cheap. One property of FFT
squaring is that:
(sum of the input FFT values)^2 = (sum of the output IFFT values)
Since we are using floating point numbers we must change the "equals sign"
above
to "approximately equals".
>>
If we were workong to infinite precison, shouldn't the output IFFT values be
integers?
In which case rounding these values to integers before summing them should
provide exactly the stringent checksum we want?
_________________________________________________________________
Be one of the first to try Windows Live Mail.
http://ideas.live.com/programpage.aspx?versionId=5d21c51a-b161-4314-9b0e-4911fb2b2e6d
_______________________________________________
Prime mailing list
[email protected]
http://hogranch.com/mailman/listinfo/prime
