search for: acuracy

...- 12.13915588266717e-15 i # incorrect imaginary part in R However, the imaginary part of the above answer is inaccurate. The correct imaginary part (from Matlab) is: 190.3079796814886 - 4.66776376640000e-15 i # correct imaginary part from Matlab This inaccuracy is serious enough to affect the acuracy of the compex-step gradient drastically. Hans and I were wondering if there is a way to obtain accurate "small" imaginary part for complex arithmetic. I am using Windows XP operating system. Thanks for taking a look at this. Best regards, Ravi. ____________________________________...

Hi Jean-Marc and list, Is the spx_fft function in fftwrap.c a standard fft function? void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) When I say standard, I mean the input "in" is 128 point short data for example and the output "out" is 128 short complex value which is stored in 256 short array with real and image part. Looks like the function did some

...liam Zhang wrote: > I read the mdf.c an my understanding is that N is actually window size for > the FFT. The actual length L = N/2 which is the frame length. The > second part of the buffer is padded with the new frame data. So this is > like the overlap-save method for improving the acuracy in calculating > the fft of > long sequence of data? The reason for the zero padding is that it's the only way to compute the convolution correctly in the frequency domain (that is, without circular convolution effects). > My hardware logic can perform N real point FFT real fast and...

Hi I believe the dt() function in stats has small areas of inaccuracy. SmallRangeMostDetaileddf150.png shows this occurring in the 10-11th decimal place. MyD4 is computed using Myt_NC(), at the bottom of BugL.R - my function is very slow due to using mpfr, but i believe accurate to the accuracy of genhypergeo() which it uses - 14-15 dp. LargeRangeDiffdf150.png, which is difference

...t; > I read the mdf.c an my understanding is that N is actually window size for > > the FFT. The actual length L = N/2 which is the frame length. The > > second part of the buffer is padded with the new frame data. So this is > > like the overlap-save method for improving the acuracy in calculating > > the fft of > > long sequence of data? > > The reason for the zero padding is that it's the only way to compute the > convolution correctly in the frequency domain (that is, without circular > convolution effects). > > > My hardware logic can p...