2 * LSP routines for ACELP-based codecs
4 * Copyright (c) 2007 Reynaldo H. Verdejo Pinochet (QCELP decoder)
5 * Copyright (c) 2008 Vladimir Voroshilov
7 * This file is part of FFmpeg.
9 * FFmpeg is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public
11 * License as published by the Free Software Foundation; either
12 * version 2.1 of the License, or (at your option) any later version.
14 * FFmpeg is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with FFmpeg; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
30 #include "celp_math.h"
31 #include "libavcodec/mips/lsp_mips.h"
32 #include "libavutil/avassert.h"
35 void ff_acelp_reorder_lsf(int16_t* lsfq, int lsfq_min_distance, int lsfq_min, int lsfq_max, int lp_order)
39 /* sort lsfq in ascending order. float bubble agorithm,
40 O(n) if data already sorted, O(n^2) - otherwise */
41 for(i=0; i<lp_order-1; i++)
42 for(j=i; j>=0 && lsfq[j] > lsfq[j+1]; j--)
43 FFSWAP(int16_t, lsfq[j], lsfq[j+1]);
45 for(i=0; i<lp_order; i++)
47 lsfq[i] = FFMAX(lsfq[i], lsfq_min);
48 lsfq_min = lsfq[i] + lsfq_min_distance;
50 lsfq[lp_order-1] = FFMIN(lsfq[lp_order-1], lsfq_max);//Is warning required ?
53 void ff_set_min_dist_lsf(float *lsf, double min_spacing, int size)
57 for (i = 0; i < size; i++)
58 prev = lsf[i] = FFMAX(lsf[i], prev + min_spacing);
61 void ff_acelp_lsf2lsp(int16_t *lsp, const int16_t *lsf, int lp_order)
65 /* Convert LSF to LSP, lsp=cos(lsf) */
66 for(i=0; i<lp_order; i++)
67 // 20861 = 2.0 / PI in (0.15)
68 lsp[i] = ff_cos(lsf[i] * 20861 >> 15); // divide by PI and (0,13) -> (0,14)
71 void ff_acelp_lsf2lspd(double *lsp, const float *lsf, int lp_order)
75 for(i = 0; i < lp_order; i++)
76 lsp[i] = cos(2.0 * M_PI * lsf[i]);
80 * @brief decodes polynomial coefficients from LSP
81 * @param[out] f decoded polynomial coefficients (-0x20000000 <= (3.22) <= 0x1fffffff)
82 * @param lsp LSP coefficients (-0x8000 <= (0.15) <= 0x7fff)
84 static void lsp2poly(int* f, const int16_t* lsp, int lp_half_order)
88 f[0] = 0x400000; // 1.0 in (3.22)
89 f[1] = -lsp[0] << 8; // *2 and (0.15) -> (3.22)
91 for(i=2; i<=lp_half_order; i++)
95 f[j] -= MULL(f[j-1], lsp[2*i-2], FRAC_BITS) - f[j-2];
97 f[1] -= lsp[2*i-2] << 8;
101 void ff_acelp_lsp2lpc(int16_t* lp, const int16_t* lsp, int lp_half_order)
104 int f1[MAX_LP_HALF_ORDER+1]; // (3.22)
105 int f2[MAX_LP_HALF_ORDER+1]; // (3.22)
107 lsp2poly(f1, lsp , lp_half_order);
108 lsp2poly(f2, lsp+1, lp_half_order);
110 /* 3.2.6 of G.729, Equations 25 and 26*/
112 for(i=1; i<lp_half_order+1; i++)
114 int ff1 = f1[i] + f1[i-1]; // (3.22)
115 int ff2 = f2[i] - f2[i-1]; // (3.22)
117 ff1 += 1 << 10; // for rounding
118 lp[i] = (ff1 + ff2) >> 11; // divide by 2 and (3.22) -> (3.12)
119 lp[(lp_half_order << 1) + 1 - i] = (ff1 - ff2) >> 11; // divide by 2 and (3.22) -> (3.12)
123 void ff_amrwb_lsp2lpc(const double *lsp, float *lp, int lp_order)
125 int lp_half_order = lp_order >> 1;
126 double buf[MAX_LP_HALF_ORDER + 1];
127 double pa[MAX_LP_HALF_ORDER + 1];
128 double *qa = buf + 1;
133 ff_lsp2polyf(lsp , pa, lp_half_order );
134 ff_lsp2polyf(lsp + 1, qa, lp_half_order - 1);
136 for (i = 1, j = lp_order - 1; i < lp_half_order; i++, j--) {
137 double paf = pa[i] * (1 + lsp[lp_order - 1]);
138 double qaf = (qa[i] - qa[i-2]) * (1 - lsp[lp_order - 1]);
139 lp[i-1] = (paf + qaf) * 0.5;
140 lp[j-1] = (paf - qaf) * 0.5;
143 lp[lp_half_order - 1] = (1.0 + lsp[lp_order - 1]) *
144 pa[lp_half_order] * 0.5;
146 lp[lp_order - 1] = lsp[lp_order - 1];
149 void ff_acelp_lp_decode(int16_t* lp_1st, int16_t* lp_2nd, const int16_t* lsp_2nd, const int16_t* lsp_prev, int lp_order)
151 int16_t lsp_1st[MAX_LP_ORDER]; // (0.15)
154 /* LSP values for first subframe (3.2.5 of G.729, Equation 24)*/
155 for(i=0; i<lp_order; i++)
157 lsp_1st[i] = (lsp_2nd[i] >> 1) + (lsp_prev[i] >> 1);
159 lsp_1st[i] = (lsp_2nd[i] + lsp_prev[i]) >> 1;
162 ff_acelp_lsp2lpc(lp_1st, lsp_1st, lp_order >> 1);
164 /* LSP values for second subframe (3.2.5 of G.729)*/
165 ff_acelp_lsp2lpc(lp_2nd, lsp_2nd, lp_order >> 1);
169 void ff_lsp2polyf(const double *lsp, double *f, int lp_half_order)
176 for(i=2; i<=lp_half_order; i++)
178 double val = -2 * lsp[2*i];
179 f[i] = val * f[i-1] + 2*f[i-2];
181 f[j] += f[j-1] * val + f[j-2];
185 #endif /* ff_lsp2polyf */
187 void ff_acelp_lspd2lpc(const double *lsp, float *lpc, int lp_half_order)
189 double pa[MAX_LP_HALF_ORDER+1], qa[MAX_LP_HALF_ORDER+1];
190 float *lpc2 = lpc + (lp_half_order << 1) - 1;
192 av_assert2(lp_half_order <= MAX_LP_HALF_ORDER);
194 ff_lsp2polyf(lsp, pa, lp_half_order);
195 ff_lsp2polyf(lsp + 1, qa, lp_half_order);
197 while (lp_half_order--) {
198 double paf = pa[lp_half_order+1] + pa[lp_half_order];
199 double qaf = qa[lp_half_order+1] - qa[lp_half_order];
201 lpc [ lp_half_order] = 0.5*(paf+qaf);
202 lpc2[-lp_half_order] = 0.5*(paf-qaf);
206 void ff_sort_nearly_sorted_floats(float *vals, int len)
210 for (i = 0; i < len - 1; i++)
211 for (j = i; j >= 0 && vals[j] > vals[j+1]; j--)
212 FFSWAP(float, vals[j], vals[j+1]);