search for: denormal_numb

Hi, I was doing some speed and compression comparisons with various apodization/windowing functions, and found out that the definitions for the bartlett and bartlett_hann window in the FLAC codebase have been wrong since their introduction. The attached patch fixes that. Furthermore, I found some peculiar behaviour of the gauss apodization that seems to expose bug. Using different windows

...the > case when using FLAC 1.3.0. > > I used gprof to check and it seems that the time spend in the > function FLAC__lpc_compute_autocorrelation_intrin_sse_lag_16 > increases 20-fold while the number of calls stays the same. > Could this be a bug? <http://en.wikipedia.org/wiki/Denormal_number#Performance_issues> ? Try something like this: void FLAC__window_gauss(FLAC__real *window, const FLAC__int32 L, const FLAC__real stddev) { static const double anti_denormal = 0.88817841970012523233890533447266e-15; /* 2e-50 */ const FLAC__int32 N = L - 1; const double N2 = (double)N / 2.;...

Hi, I experience surprisingly large timing differences for the multiplication of matrices of the same dimension. An example is given below. How can this be explained? I posted the question on Stackoverflow: https://stackoverflow.com/questions/58886111/r-why-is-matrix-product-slower-when-matrix-has-very-small-values Somebody could reproduce the behavior but I did not get any useful explanations