/* (C) 2007 Jean-Marc Valin, CSIRO */ /* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. - Neither the name of the Xiph.org Foundation nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "mathops.h" #include "cwrs.h" #include "vq.h" #include "arch.h" #include "os_support.h" /** Takes the pitch vector and the decoded residual vector (non-compressed), applies the compression in the pitch direction, computes the gain that will give ||p+g*y||=1 and mixes the residual with the pitch. */ static void mix_pitch_and_residual(int *iy, celt_norm_t *X, int N, int K, const celt_norm_t *P, celt_word16_t alpha) { int i; celt_word32_t Ryp, Ryy, Rpp; celt_word32_t g; VARDECL(celt_norm_t, y); #ifdef FIXED_POINT int yshift; #endif SAVE_STACK; #ifdef FIXED_POINT yshift = 14-EC_ILOG(K); #endif ALLOC(y, N, celt_norm_t); /*for (i=0;i 0) { int pulsesAtOnce=1; int Lupdate = L; int L2 = L; /* Decide on complexity strategy */ pulsesAtOnce = pulsesLeft/N; if (pulsesAtOnce<1) pulsesAtOnce = 1; if (pulsesLeft-pulsesAtOnce > 3 || N > 30) Lupdate = 1; /*printf ("%d %d %d/%d %d\n", Lupdate, pulsesAtOnce, pulsesLeft, K, N);*/ L2 = Lupdate; if (L2>maxL) { L2 = maxL; maxL *= N; } for (m=0;mscore = -VERY_LARGE32; for (m=0;m0) sign=1; else sign=-1;*/ for (sign=-1;sign<=1;sign+=2) { /*fprintf (stderr, "%d/%d %d/%d %d/%d\n", i, K, m, L2, j, N);*/ celt_word32_t Rxy, Ryy, Ryp; celt_word16_t spj, aspj; /* Intermediate results */ celt_word32_t score; celt_word32_t g; celt_word16_t s = SHL16(sign*pulsesAtOnce, yshift); /* All pulses at one location must have the same sign. */ if (iy[m][j]*sign < 0) continue; spj = MULT16_16_Q14(s, P[j]); aspj = MULT16_16_Q15(alpha, spj); /* Updating the sums of the new pulse(s) */ Rxy = xy[m] + MULT16_16(s,X[j]) - MULT16_16(MULT16_16_Q15(alpha,spj),Rxp); Ryy = yy[m] + 2*MULT16_16(s,y[m][j]) + MULT16_16(s,s) +MULT16_16(aspj,MULT16_16_Q14(aspj,Rpp)) - 2*MULT16_32_Q14(aspj,yp[m]) - 2*MULT16_16(s,MULT16_16_Q14(aspj,P[j])); Ryp = yp[m] + MULT16_16(spj, SUB16(QCONST16(1.f,14),MULT16_16_Q15(alpha,Rpp))); /* Compute the gain such that ||p + g*y|| = 1 */ g = MULT16_32_Q15( celt_sqrt(MULT16_16(ROUND16(Ryp,14),ROUND16(Ryp,14)) + Ryy - MULT16_16(ROUND16(Ryy,14),Rpp)) - ROUND16(Ryp,14), celt_rcp(SHR32(Ryy,12))); /* Knowing that gain, what's the error: (x-g*y)^2 (result is negated and we discard x^2 because it's constant) */ /*score = 2.f*g*Rxy - 1.f*g*g*Ryy*NORM_SCALING_1;*/ score = 2*MULT16_32_Q14(ROUND16(Rxy,14),g) - MULT16_32_Q14(EXTRACT16(MULT16_32_Q14(ROUND16(Ryy,14),g)),g); if (score>nbest[Lupdate-1]->score) { int id = Lupdate-1; struct NBest *tmp_best; /* Save some pointers that would be deleted and use them for the current entry*/ tmp_best = nbest[Lupdate-1]; while (id > 0 && score > nbest[id-1]->score) id--; for (k=Lupdate-1;k>id;k--) nbest[k] = nbest[k-1]; nbest[id] = tmp_best; nbest[id]->score = score; nbest[id]->pos = j; nbest[id]->orig = m; nbest[id]->sign = sign; nbest[id]->xy = Rxy; nbest[id]->yy = Ryy; nbest[id]->yp = Ryp; } } } } celt_assert2(nbest[0]->score > -VERY_LARGE32, "Could not find any match in VQ codebook. Something got corrupted somewhere."); /* Only now that we've made the final choice, update ny/iny and others */ for (k=0;ksign*pulsesAtOnce; s = SHL16(is, yshift); for (n=0;norig][n] - MULT16_16_Q15(alpha,MULT16_16_Q14(s,MULT16_16_Q14(P[nbest[k]->pos],P[n]))); ny[k][nbest[k]->pos] += s; for (n=0;norig][n]; iny[k][nbest[k]->pos] += is; xy[k] = nbest[k]->xy; yy[k] = nbest[k]->yy; yp[k] = nbest[k]->yp; } /* Swap ny/iny with y/iy */ for (k=0;kgain*y[0][i])*(x[i]-nbest[0]->gain*y[0][i]); /*if (N<=10) printf ("%f %d %d\n", err, K, N);*/ } /* Sanity checks, don't bother */ if (0) { for (i=0;igain*y[0][i]; celt_word32_t E=1e-15; int ABS = 0; for (i=0;i 32) max_pos = 32; for (i=0;i best_score) { best_score = score; best = i; if (xy>0) s = 1; else s = -1; } } if (s<0) sign = 1; else sign = 0; /*printf ("%d %d ", sign, best);*/ ec_enc_uint(enc,sign,2); ec_enc_uint(enc,best/B,max_pos); /*printf ("%d %f\n", best, best_score);*/ if (K>10) pred_gain = pg[10]; else pred_gain = pg[K]; E = EPSILON; for (j=0;j0) { for (j=0;j 32) max_pos = 32; sign = ec_dec_uint(dec, 2); if (sign == 0) s = 1; else s = -1; best = B*ec_dec_uint(dec, max_pos); /*printf ("%d %d ", sign, best);*/ if (K>10) pred_gain = pg[10]; else pred_gain = pg[K]; E = EPSILON; for (j=0;j= (Nmax>>1)) { for (i=0;i