search for: fpus

...d Welford's algorithm (see Chan & Lewis, 1979, CACM 22, 526-531 and references therein). However, R already used the two-pass algorithm which is the most accurate (in terms of error bounds) in that reference. Why are most people seeing 0? Because the way computation is done in modern FPUs is not the computation analysed in early numerical analysis papers, including in Chan & Lewis. First, all FPUs that I am aware of allow the use of guard digits, effectively doing intermediate computations to one more bit than required. And many use extended precision registers for computa...

...of speech from a librevox recording. It managed this at a > respectable pace for complexity 10: Complexity 10 is new analysis code that didn't exist in prior versions, setting complexity 5 gets you basically the same analysis that the 1.0 version had. On x86 and modern arm cores with fast FPUs the other speedups are enough that complexity 10 is about the same speed in the old software or the new software (but with much higher and consistent VBR quality). But on chips with slow FPUs the new analysis code is much slower, in particular because it has not been entirely converted to fixed po...

...t;> > respectable pace for complexity 10: >> >> Complexity 10 is new analysis code that didn't exist in prior >> versions, setting complexity 5 gets you basically the same analysis >> that the 1.0 version had. >> >> On x86 and modern arm cores with fast FPUs the other speedups are >> enough that complexity 10 is about the same speed in the old software >> or the new software (but with much higher and consistent VBR quality). >> But on chips with slow FPUs the new analysis code is much slower, in >> particular because it has not...

...erstood it describes the assembly instructions? But why would I tell Clang to target "mips1" when the design of the R3000 is RISC? Why isn't RISCV correct then? Or RISC1 or so... Also how does that influence floating point arithmetic? I often heard that those are separated processors FPUs(?). So could it be, that there is an additional processor besides the processor I know about? Like R3000 + FPU? Wouldn't had Clang or any other compiler to know about such a construct or is that not the case? Sorry again if this is too much off topic - I simply never thought about such stuff b...

...t;> > respectable pace for complexity 10: >> >> Complexity 10 is new analysis code that didn't exist in prior >> versions, setting complexity 5 gets you basically the same analysis >> that the 1.0 version had. >> >> On x86 and modern arm cores with fast FPUs the other speedups are >> enough that complexity 10 is about the same speed in the old software >> or the new software (but with much higher and consistent VBR quality). >> But on chips with slow FPUs the new analysis code is much slower, in >> particular because it has not...

I have just started trying Opus with a view to using it in a project. I am interested in embedded hardware and tried it on the Raspberry Pi using the raspbian distro. The version of libopus in the repos is 0.9.14. I installed this and tried encoding 2 minutes of speech from a librevox recording. It managed this at a respectable pace for complexity 10: Skipping chunk of type "LIST",

...extensions | Y | N | N | N | | .arch with '+<ext>' | N | N | N | Y | | .arch_extension | Y | Y | Y | N | | .fpu | Y | N | Y | N | | -mfpu | Y | N | Y | N | | checks FPUs | N | n/a | N | n/a | |----------------------|-----|---------|-----|---------| Examples of each of these can be found at the end of this document. Problems With the Current Options --------------------------------- - You cannot select all extensions through an assembly direc...

...t; >> >> >> Complexity 10 is new analysis code that didn't exist in prior >> >> versions, setting complexity 5 gets you basically the same analysis >> >> that the 1.0 version had. >> >> >> >> On x86 and modern arm cores with fast FPUs the other speedups are >> >> enough that complexity 10 is about the same speed in the old software >> >> or the new software (but with much higher and consistent VBR quality). >> >> But on chips with slow FPUs the new analysis code is much slower, in >> &g...

> a <- 0 ; for(i in (1:200000000)) a <- a + 1/i > b <- 0 ; for(i in (200000000:1)) b <- b + 1/i > c <- sum(1/(1:200000000)) > d <- sum(1/(200000000:1)) > order(c(a,b,c,d)) [1] 1 2 4 3 > b<c [1] TRUE > c==d [1] FALSE I'd expected b being the largest, since we sum up the smallest numbers first. Instead, c is the largest, which is

...extensions | Y | N | N | N | | .arch with '+<ext>' | N | N | N | Y | | .arch_extension | Y | Y | Y | N | | .fpu | Y | N | Y | N | | -mfpu | Y | N | Y | N | | checks FPUs | N | n/a | N | n/a | |----------------------|-----|---------|-----|---------| Examples of each of these can be found at the end of this document. Problems With the Current Options --------------------------------- - You cannot select all extensions through an assembly direc...

...extensions | Y | N | N | N | | .arch with '+<ext>' | N | N | N | Y | | .arch_extension | Y | Y | Y | N | | .fpu | Y | N | Y | N | | -mfpu | Y | N | Y | N | | checks FPUs | N | n/a | N | n/a | |----------------------|-----|---------|-----|---------| Examples of each of these can be found at the end of this document. Problems With the Current Options --------------------------------- - You cannot select all extensions through an assembly direc...

...or complexity 10: > >> > >> Complexity 10 is new analysis code that didn't exist in prior > >> versions, setting complexity 5 gets you basically the same analysis > >> that the 1.0 version had. > >> > >> On x86 and modern arm cores with fast FPUs the other speedups are > >> enough that complexity 10 is about the same speed in the old software > >> or the new software (but with much higher and consistent VBR quality). > >> But on chips with slow FPUs the new analysis code is much slower, in > >> particula...

...or complexity 10: > >> > >> Complexity 10 is new analysis code that didn't exist in prior > >> versions, setting complexity 5 gets you basically the same analysis > >> that the 1.0 version had. > >> > >> On x86 and modern arm cores with fast FPUs the other speedups are > >> enough that complexity 10 is about the same speed in the old software > >> or the new software (but with much higher and consistent VBR quality). > >> But on chips with slow FPUs the new analysis code is much slower, in > >> particula...

...rs, but always uses (Rn, Rn+1) pairs and is incapable of scheduling the two 32-bit move instructions independently, since the two are output at the very last minute by the last part of the machine-dependent backend/ This is slow when moving such a 2x32-bit value to a 64-bit register in one the ARM FPUs, since two 32-bit moves to the low and high halves of the same FPU register incur a 7-cycle delay - a fairly common occurrence when double args are moved into FPU regs for processing. If it could schedule the two 32-bit moves separately, up to 6 other instructions could be executed in the mean time...

Dear All For my calculations, I am needing to use more floating-point precision than the default one of R. Is that possible? And, if yes, how? Thanks in advance, Paul

...Complexity 10 is new analysis code that didn't exist in prior > >> versions, setting complexity 5 gets you basically the same > analysis > >> that the 1.0 version had. > >> > >> On x86 and modern arm cores with fast FPUs the other speedups are > >> enough that complexity 10 is about the same speed in the old > software > >> or the new software (but with much higher and consistent VBR > quality). > >> But on chips with slow FPUs the new analys...

For the interested, the Phatbox (a car audio system) now has firmware to support FLAC files. I have a news bullet on the FLAC site: http://flac.sourceforge.net/news.html#20020213 This is the first hardware support for FLAC (more is coming) and I think the first support of any non-proprietary lossless audio format for any hardware. Kudos to Phatnoise for taking the lead. Josh

how R implement qnorm() I wonder anyone knows the mathematical process that R calculated the quantile? The reason I asked is soly by curiosity. I know the probability of a normal distribution is calculated through integrate the Gaussian function, which can be implemented easily (see code), while the calculation of quantile (or Zα) in R is a bit confusing as it requires inverse error function (X

So, In order to fix bug PR20787 (common parsing infrastructure for FPU options between LLVM and tools), I need to create a parser in LLVM that has all targets' information (types of fpus, cpus, archs, etc) but that can also be visible by external tools. Until now, all that information has been hidden from view by creating them with TableGen and leave them only visible to the target files. That makes a lot of sense, but I need some of that exposed. Including generated files from L...

Full_Name: Hans Peter Wolf Version: 1.2.1 OS: hpux10.20 Submission from: (NULL) (129.70.84.25) dbeta computes a wrong result with parameters (1.3,1) > version platform hppa2.0-hp-hpux10.20 arch hppa2.0 os hpux10.20 system hppa2.0, hpux10.20 status major 1 minor 2.1 year