38 for(i=0; i<lp_order-1; i++)
39 for(j=i; j>=0 && lsfq[j] > lsfq[j+1]; j--)
40 FFSWAP(int16_t, lsfq[j], lsfq[j+1]);
42 for(i=0; i<lp_order; i++)
44 lsfq[i] =
FFMAX(lsfq[i], lsfq_min);
45 lsfq_min = lsfq[i] + lsfq_min_distance;
47 lsfq[lp_order-1] =
FFMIN(lsfq[lp_order-1], lsfq_max);
54 for (i = 0; i <
size; i++)
55 prev = lsf[i] =
FFMAX(lsf[i], prev + min_spacing);
63 for(i=0; i<lp_order; i++)
65 lsp[i] =
ff_cos(lsf[i] * 20861 >> 15);
72 for(i = 0; i < lp_order; i++)
73 lsp[i] = cos(2.0 *
M_PI * lsf[i]);
81 static void lsp2poly(
int*
f,
const int16_t* lsp,
int lp_half_order)
88 for(i=2; i<=lp_half_order; i++)
94 f[1] -= lsp[2*i-2] << 8;
109 for(i=1; i<lp_half_order+1; i++)
111 int ff1 = f1[i] + f1[i-1];
112 int ff2 = f2[i] - f2[i-1];
115 lp[i] = (ff1 + ff2) >> 11;
116 lp[(lp_half_order << 1) + 1 - i] = (ff1 - ff2) >> 11;
122 int lp_half_order = lp_order >> 1;
125 double *qa = buf + 1;
133 for (i = 1, j = lp_order - 1; i < lp_half_order; i++, j--) {
134 double paf = pa[i] * (1 + lsp[lp_order - 1]);
135 double qaf = (qa[i] - qa[i-2]) * (1 - lsp[lp_order - 1]);
136 lp[i-1] = (paf + qaf) * 0.5;
137 lp[j-1] = (paf - qaf) * 0.5;
140 lp[lp_half_order - 1] = (1.0 + lsp[lp_order - 1]) *
141 pa[lp_half_order] * 0.5;
143 lp[lp_order - 1] = lsp[lp_order - 1];
146 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)
152 for(i=0; i<lp_order; i++)
153 lsp_1st[i] = (lsp_2nd[i] + lsp_prev[i]) >> 1;
168 for(i=2; i<=lp_half_order; i++)
170 double val = -2 * lsp[2*i];
171 f[i] = val * f[i-1] + 2*f[i-2];
173 f[j] += f[j-1] * val + f[j-2];
181 float *lpc2 = lpc + (lp_half_order << 1) - 1;
188 while (lp_half_order--) {
189 double paf = pa[lp_half_order+1] + pa[lp_half_order];
190 double qaf = qa[lp_half_order+1] - qa[lp_half_order];
192 lpc [ lp_half_order] = 0.5*(paf+qaf);
193 lpc2[-lp_half_order] = 0.5*(paf-qaf);
201 for (i = 0; i < len - 1; i++)
202 for (j = i; j >= 0 && vals[j] > vals[j+1]; j--)
203 FFSWAP(
float, vals[j], vals[j+1]);