3 * Copyright (c) 2006 Justin Ruggles <justin.ruggles@gmail.com>
5 * This file is part of Libav.
7 * Libav is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * Libav is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with Libav; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22 #include "libavutil/common.h"
23 #include "libavutil/lls.h"
25 #define LPC_USE_DOUBLE
30 * Apply Welch window function to audio block
32 static void lpc_apply_welch_window_c(const int32_t *data, int len,
39 /* The optimization in commit fa4ed8c does not support odd len.
40 * If someone wants odd len extend that change. */
44 c = 2.0 / (len - 1.0);
51 w_data[-i-1] = data[-i-1] * w;
52 w_data[+i ] = data[+i ] * w;
57 * Calculate autocorrelation data from audio samples
58 * A Welch window function is applied before calculation.
60 static void lpc_compute_autocorr_c(const double *data, int len, int lag,
65 for(j=0; j<lag; j+=2){
66 double sum0 = 1.0, sum1 = 1.0;
68 sum0 += data[i] * data[i-j];
69 sum1 += data[i] * data[i-j-1];
77 for(i=j-1; i<len; i+=2){
78 sum += data[i ] * data[i-j ]
79 + data[i+1] * data[i-j+1];
86 * Quantize LPC coefficients
88 static void quantize_lpc_coefs(double *lpc_in, int order, int precision,
89 int32_t *lpc_out, int *shift, int max_shift, int zero_shift)
96 /* define maximum levels */
97 qmax = (1 << (precision - 1)) - 1;
99 /* find maximum coefficient value */
101 for(i=0; i<order; i++) {
102 cmax= FFMAX(cmax, fabs(lpc_in[i]));
105 /* if maximum value quantizes to zero, return all zeros */
106 if(cmax * (1 << max_shift) < 1.0) {
108 memset(lpc_out, 0, sizeof(int32_t) * order);
112 /* calculate level shift which scales max coeff to available bits */
114 while((cmax * (1 << sh) > qmax) && (sh > 0)) {
118 /* since negative shift values are unsupported in decoder, scale down
119 coefficients instead */
120 if(sh == 0 && cmax > qmax) {
121 double scale = ((double)qmax) / cmax;
122 for(i=0; i<order; i++) {
127 /* output quantized coefficients and level shift */
129 for(i=0; i<order; i++) {
130 error -= lpc_in[i] * (1 << sh);
131 lpc_out[i] = av_clip(lrintf(error), -qmax, qmax);
137 static int estimate_best_order(double *ref, int min_order, int max_order)
142 for(i=max_order-1; i>=min_order-1; i--) {
152 * Calculate LPC coefficients for multiple orders
154 * @param lpc_type LPC method for determining coefficients,
155 * see #FFLPCType for details
157 int ff_lpc_calc_coefs(LPCContext *s,
158 const int32_t *samples, int blocksize, int min_order,
159 int max_order, int precision,
160 int32_t coefs[][MAX_LPC_ORDER], int *shift,
161 enum FFLPCType lpc_type, int lpc_passes,
162 int omethod, int max_shift, int zero_shift)
164 double autoc[MAX_LPC_ORDER+1];
165 double ref[MAX_LPC_ORDER];
166 double lpc[MAX_LPC_ORDER][MAX_LPC_ORDER];
170 assert(max_order >= MIN_LPC_ORDER && max_order <= MAX_LPC_ORDER &&
171 lpc_type > FF_LPC_TYPE_FIXED);
173 /* reinit LPC context if parameters have changed */
174 if (blocksize != s->blocksize || max_order != s->max_order ||
175 lpc_type != s->lpc_type) {
177 ff_lpc_init(s, blocksize, max_order, lpc_type);
180 if (lpc_type == FF_LPC_TYPE_LEVINSON) {
181 s->lpc_apply_welch_window(samples, blocksize, s->windowed_samples);
183 s->lpc_compute_autocorr(s->windowed_samples, blocksize, max_order, autoc);
185 compute_lpc_coefs(autoc, max_order, &lpc[0][0], MAX_LPC_ORDER, 0, 1);
187 for(i=0; i<max_order; i++)
188 ref[i] = fabs(lpc[i][i]);
189 } else if (lpc_type == FF_LPC_TYPE_CHOLESKY) {
191 double var[MAX_LPC_ORDER+1], av_uninit(weight);
193 for(pass=0; pass<lpc_passes; pass++){
194 av_init_lls(&m[pass&1], max_order);
197 for(i=max_order; i<blocksize; i++){
198 for(j=0; j<=max_order; j++)
199 var[j]= samples[i-j];
202 double eval, inv, rinv;
203 eval= av_evaluate_lls(&m[(pass-1)&1], var+1, max_order-1);
204 eval= (512>>pass) + fabs(eval - var[0]);
207 for(j=0; j<=max_order; j++)
213 av_update_lls(&m[pass&1], var, 1.0);
215 av_solve_lls(&m[pass&1], 0.001, 0);
218 for(i=0; i<max_order; i++){
219 for(j=0; j<max_order; j++)
220 lpc[i][j]=-m[(pass-1)&1].coeff[i][j];
221 ref[i]= sqrt(m[(pass-1)&1].variance[i] / weight) * (blocksize - max_order) / 4000;
223 for(i=max_order-1; i>0; i--)
224 ref[i] = ref[i-1] - ref[i];
226 opt_order = max_order;
228 if(omethod == ORDER_METHOD_EST) {
229 opt_order = estimate_best_order(ref, min_order, max_order);
231 quantize_lpc_coefs(lpc[i], i+1, precision, coefs[i], &shift[i], max_shift, zero_shift);
233 for(i=min_order-1; i<max_order; i++) {
234 quantize_lpc_coefs(lpc[i], i+1, precision, coefs[i], &shift[i], max_shift, zero_shift);
241 av_cold int ff_lpc_init(LPCContext *s, int blocksize, int max_order,
242 enum FFLPCType lpc_type)
244 s->blocksize = blocksize;
245 s->max_order = max_order;
246 s->lpc_type = lpc_type;
248 if (lpc_type == FF_LPC_TYPE_LEVINSON) {
249 s->windowed_buffer = av_mallocz((blocksize + 2 + FFALIGN(max_order, 4)) *
250 sizeof(*s->windowed_samples));
251 if (!s->windowed_buffer)
252 return AVERROR(ENOMEM);
253 s->windowed_samples = s->windowed_buffer + FFALIGN(max_order, 4);
255 s->windowed_samples = NULL;
258 s->lpc_apply_welch_window = lpc_apply_welch_window_c;
259 s->lpc_compute_autocorr = lpc_compute_autocorr_c;
267 av_cold void ff_lpc_end(LPCContext *s)
269 av_freep(&s->windowed_buffer);