david eddy wrote: >I apologize if I am being naive here, but is it fair >to say that for an FFT size of 1024K (2^20), a number >(MOD the exponent) is split into the >2^20 digits (base 32) for input? > >The output is then 2^20 floating point numbers, >each of which is rounded to the nearest integer? > >
the FP numbers used are double precision (64 bit) which have ~48 bits of mantissa, so the 1 million bit FFT size is, I believe, broken into 48 bit chunks, about 21000 of them? _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
