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
28 #define ORDER_METHOD_EST 0
29 #define ORDER_METHOD_2LEVEL 1
30 #define ORDER_METHOD_4LEVEL 2
31 #define ORDER_METHOD_8LEVEL 3
32 #define ORDER_METHOD_SEARCH 4
33 #define ORDER_METHOD_LOG 5
35 #define MIN_LPC_ORDER 1
36 #define MAX_LPC_ORDER 32
42 FF_LPC_TYPE_DEFAULT = -1, ///< use the codec default LPC type
43 FF_LPC_TYPE_NONE = 0, ///< do not use LPC prediction or use all zero coefficients
44 FF_LPC_TYPE_FIXED = 1, ///< fixed LPC coefficients
45 FF_LPC_TYPE_LEVINSON = 2, ///< Levinson-Durbin recursion
46 FF_LPC_TYPE_CHOLESKY = 3, ///< Cholesky factorization
47 FF_LPC_TYPE_NB , ///< Not part of ABI
50 typedef struct LPCContext {
53 enum FFLPCType lpc_type;
54 double *windowed_buffer;
55 double *windowed_samples;
58 * Apply a Welch window to an array of input samples.
59 * The output samples have the same scale as the input, but are in double
61 * @param data input samples
62 * @param len number of input samples
63 * @param w_data output samples
65 void (*lpc_apply_welch_window)(const int32_t *data, int len,
68 * Perform autocorrelation on input samples with delay of 0 to lag.
69 * @param data input samples.
70 * constraints: no alignment needed, but must have have at
71 * least lag*sizeof(double) valid bytes preceding it, and
72 * size must be at least (len+1)*sizeof(double) if data is
73 * 16-byte aligned or (len+2)*sizeof(double) if data is
75 * @param len number of input samples to process
76 * @param lag maximum delay to calculate
77 * @param autoc output autocorrelation coefficients.
78 * constraints: array size must be at least lag+1.
80 void (*lpc_compute_autocorr)(const double *data, int len, int lag,
86 * Calculate LPC coefficients for multiple orders
88 int ff_lpc_calc_coefs(LPCContext *s,
89 const int32_t *samples, int blocksize, int min_order,
90 int max_order, int precision,
91 int32_t coefs[][MAX_LPC_ORDER], int *shift,
92 enum FFLPCType lpc_type, int lpc_passes,
93 int omethod, int max_shift, int zero_shift);
96 * Initialize LPCContext.
98 int ff_lpc_init(LPCContext *s, int blocksize, int max_order,
99 enum FFLPCType lpc_type);
100 void ff_lpc_init_x86(LPCContext *s);
103 * Uninitialize LPCContext.
105 void ff_lpc_end(LPCContext *s);
107 #ifdef LPC_USE_DOUBLE
108 #define LPC_TYPE double
110 #define LPC_TYPE float
114 * Levinson-Durbin recursion.
115 * Produce LPC coefficients from autocorrelation data.
117 static inline int compute_lpc_coefs(const LPC_TYPE *autoc, int max_order,
118 LPC_TYPE *lpc, int lpc_stride, int fail,
123 LPC_TYPE *lpc_last = lpc;
128 if (fail && (autoc[max_order - 1] == 0 || err <= 0))
131 for(i=0; i<max_order; i++) {
132 LPC_TYPE r = -autoc[i];
136 r -= lpc_last[j] * autoc[i-j-1];
139 err *= 1.0 - (r * r);
144 for(j=0; j < (i+1)>>1; j++) {
145 LPC_TYPE f = lpc_last[ j];
146 LPC_TYPE b = lpc_last[i-1-j];
148 lpc[i-1-j] = b + r * f;
161 #endif /* AVCODEC_LPC_H */