search for: q15

...1: note: === vect_do_peeling_for_loop_bound ===Setting upper bound of nb iterations for epilogue loop to 14 test.c:11: note: LOOP VECTORIZED. The result is a very concise and very dense code: vld1.8 {d28[], d29[]}, [r5] vld3.8 {d16, d18, d20}, [r9]! vld3.8 {d17, d19, d21}, [r9] vmvn q3, q8 vmvn q15, q9 vmvn q8, q10 vsub.i8 q11, q3, q14 vsub.i8 q12, q15, q14 vsub.i8 q13, q8, q14 vst3.8 {d22, d24, d26}, [r8]! vst3.8 {d23, d25, d27}, [r8] cheers, --renato -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/201...

> One thing I've noticed so far in the filter_mem2 code is the calls to > SATURATE(x, 805306368). 805306368 is 0x30000000. I was expecting that > to be on a bit boundary, say 0x3fffffff? In which case the arithmetic > saturation logic could be used. I don't think it would make that big of a difference, since the saturation is outside of the inner loop. If it's that

...0.0e+00 Q10 <--- G param11 0.72 0.054 13.3 0.0e+00 Q11 <--- G param12 0.59 0.063 9.3 0.0e+00 Q12 <--- G param13 0.61 0.069 8.7 0.0e+00 Q13 <--- G param14 0.70 0.074 9.6 0.0e+00 Q14 <--- G param15 0.68 0.066 10.4 0.0e+00 Q15 <--- G param16 0.75 0.056 13.3 0.0e+00 Q16 <--- G param17 0.86 0.060 14.3 0.0e+00 Q17 <--- G param18 0.63 0.059 10.7 0.0e+00 Q18 <--- G param19 0.75 0.062 12.2 0.0e+00 Q19 <--- G param20 0.68 0.060 11.4 0.0e+00 Q20 <--- G...

...all, I'm currently in the process of implementing a mixing matrix into the header of OPUS files for the proposed channel mapping 3 seen here: https://tools.ietf.org/html/draft-ietf-codec-ambisonics-03#section-3.2 My implementation simply replaces writing the stream mapping char array with the Q15 col-wise matrix vals described in the above document. I'm able to write/read matrices of 4x4 and 9x9 and encode->decode first and second order just fine, but writing larger matrices causes what seems to be some sort of packet corruption. The OpusHead packet is never found, but in it's p...

...ned as follows: >p15<-ppp(x,y,window=owin(c(341710,342100),c(3126465,3126780)),marks=NUL L, checks=TRUE) Giving me a distance of 390m in the 'x' direction and 315m in the 'y' direction. I want to divide the window into quadrats of size 15m x 15m so I did the following: >q15<-quadratcount(p15,nx=26,ny=21). However, when I look at the data for quadrat counts it seems the function is not keeping the size of the quadrats constant, but is instead varying the width of the quadrats (in both the x and y direction) between 10m and 20m, meaning that some quadrats are 10m x...

...Lastname Firstname CATALOG_NBR Email StudentID EMPLID Start 1 alastname afirstname 1213 *@uark.edu 10295236 # 12/2/2008 2 anotherlastname anotherfirstname 1213 **@uark.edu ## 10295236 9/3/2008 Xattempts Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 1 1 1 1 0 0 0 0 0 0 0 1 0 0 1 1 0 1 1 0 1 2 1 1 1 1 1 1 0 1 0 0 1 1 0 0 1 0 0 0 0 1 Q20 Q21 Q22 Q23 Q24 Q25 Q26 Q27 Q28 Q29 Q30 Q31 Q32 Score Form CRSE_GRADE_OFF 1 0 0 0 0 0 0 0 0 0 1 0...

...op. If it's that critical, you >could probably remove the saturation completely and just make sure your >signals are scaled properly (i.e. not too close to saturation). > > > I just realized that. I added counters for each of the arithmetic macros and discovered that mac16_32_q15 is the most frequent. I'm not sure I can do much more without understanding the code better. Q15 is Q1.15 format, right? Looking at MAC16_32_Q15(long c, short a, long b) Is b a Q15 represented as Q17.15 so that the implementation does not depend on saturating hardware? If we do have s...

...pus. We are looking at > the code where speech probability is calculated based on which SNR is > estimated. Below is the part of the code I am talking about. > > /*********************************/ > /* Speech Probability Estimation */ > /*********************************/ > SA_Q15 = silk_sigm_Q15( silk_SMULWB( VAD_SNR_FACTOR_Q16, pSNR_dB_Q7 ) - > VAD_NEGATIVE_OFFSET_Q5 ); // step1: Calculate speech probability : comment > by me > > /* Power scaling */ > if( speech_nrg <= 0 ) { // step2: update speech probability based on > speech energy : comment by me &...

...writing my analysis chapter, I am lost as I don't know which is the best way to analyse my data after trying to find a solution for days. Basically, my questionnaire is structured in this way: Q1 - Q5: statements on environment-oriented CSR Q6 - Q10: statements on workplace-oriented CSR Q11 - Q15: statements on community-oriented CSR Q16-Q20: statements on market-oriented CSR All of the statements are 5-pt Likert questions. I initially planed to compare the grouped mean values for each of the above section but I know that it's not scientific. So can someone give me any advice on which...

...Q1 in one of my data frames has over 66% of its observations missing. I have tried imputation with mice but it does not work for all the data frames and I get the following message or a similar message to this: iter imp variable 1 1 Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q19 Q36 Q47 Q52 Q79 Q80 Q94 Q97 Q104 Q108 Q122 Q131 Q134 P1 P2 P3 P4 P5 P6Error in solve.default(xtx + diag(pen)) : system is computationally singular: reciprocal condition number = 1.83044e-16 In addition: Warning messages: 1: In sqrt((sum(residuals^2))/(sum(ry) - ncol(x) - 1...

Renato, can you post the c code for the function and the assembly that gcc produces? Your initial example could be well handled by vectorization of strided loops (and the mentioning of VLD3(.8?)/VST3(.8?) lead me to assume that this is what happened). But the LLVM-IR you sent has a store of 0 in there ;) and strides by 4. Thanks, Arnold Vectorization of strided loops: I am using float as the

..." <chandrakala.madhira at soctronics.com> Cc: opus at xiph.org Sent: Wednesday, November 22, 2017 12:12:39 PM Subject: Re: [opus] Reg an issue with smoothing factor in VAD implementation Yes, yes, I can reproduce it now, but only on platforms that define a 16-bit int by default (SA_Q15 is an opus_int rather than opus_int32). What system are you compiling this for? On Tue, Nov 21, 2017 at 8:34 PM, Chandrakala Madhira < chandrakala.madhira at soctronics.com > wrote: Hi Logan, Please find attached the input stream we are using testing. Thank you, Chandrakala...

...s in Moin Moin format; I was going to do a diff >> between the versions but then we differed so wildly in combining >> and rewriting that I think a mental diff will work better. A >> formatted draft is here: >> >> http://wiki.centos.org/KarstenWade/GeneralFAQUpdateq31q15 >> >> Thanks - Karsten > > I'd say that at least the following paragraphs from q15 are worth > preserving: - Any point release is just a "snapshot" with previous > updates, plus the latest batch of new upstream updates, rolled into > a new [base] repo wit...

This is almost ideal for SLP vectorization, except for two problems: 1. We have 4 stores to consecutive locations, but the last element is the constant zero, and not an additional SUB. At the moment we don’t have support for idempotence operations, but this is something that we should add. 2. The values that we are subtracting come from 3 loads. We usually load 4 elements from memory, or

...ys continue iterating on it. The text below is in Moin Moin format; I was going to do a diff between the versions but then we differed so wildly in combining and rewriting that I think a mental diff will work better. A formatted draft is here: http://wiki.centos.org/KarstenWade/GeneralFAQUpdateq31q15 Thanks - Karsten ####################################################################### ## begin == How does CentOS versioning work? == 1. CentOS Linux currently has 3 ''major'' released branches that are active: CentOS-5, CentOS-6, and CentOS-7. 1. CentOS Linux releases '...

On 06/09/2015 01:27 AM, Karsten Wade wrote: > [...] > http://wiki.centos.org/KarstenWade/GeneralFAQUpdateq31q15 > > Thanks - Karsten >> I'd say that at least the following paragraphs from q15 are worth >> preserving: - Any point release is just a "snapshot" with previous >> updates, plus the latest batch of new upstream updates, rolled into >> a new [base] repo wit...

Hello Jean-Marc, When you count the adaptation step size in case where the filter has already had minimal adaptation, you use the following expression: r = (0.7*r + 0.3*15*RER*e)/e*(power[i] + 10) = (0.7*leak_estimate*Yf[i] + 0.3*15*RER*(Rf[i] + 1))/((Rf[i] + 1)*(power[i] + 10)). Why do we need this weighted sum and the component 0.3*15*RER*(Rf[i] + 1)? Why use the correlation-based RER if

...has already had > minimal adaptation, you use the following expression: > > r = (0.7*r + 0.3*15*RER*e)/e*(power[i] + 10) = (0.7*leak_estimate*Yf[i] + > 0.3*15*RER*(Rf[i] + 1))/((Rf[i] + 1)*(power[i] + 10)). Actually, the QCONST16(.3,15) doesn't mean (.3*15), but the value .3 in Q15 format (fixed-point). > Why do we need this weighted sum and the component 0.3*15*RER*(Rf[i] + 1)? First, the reason for multiplying by (Rf[i]+1) is because I'll be dividing by it in the next line (and I didn't want to do divisions for both terms). > Why > use the correlation-b...

...t; heavy clipping. So using 14 fractional bits internally instead of 15 > and doing the saturation right before converting to the 16 bit output > sample value could help. But certainly there are more sophisticated > solutions to this problem. :-) I'm not too keen on doing that because Q15 is already at the limit of what I can tolerate in terms of noise. > During the tests I encountered another problem. While upsampling a > continuous ?6 dB sine from 8000 Hz to 11025 Hz I heard that the > resampler produces a click every 5 seconds. After changing the output > sample rate...

...in the process of implementing a mixing matrix into the > header of OPUS files for the proposed channel mapping 3 seen here: > https://tools.ietf.org/html/draft-ietf-codec-ambisonics-03#section-3.2 > > My implementation simply replaces writing the stream mapping char array > with the Q15 col-wise matrix vals described in the above document. > > I'm able to write/read matrices of 4x4 and 9x9 and encode->decode first > and second order just fine, but writing larger matrices causes what seems > to be some sort of packet corruption. The OpusHead packet is never found...