1cabdff1aSopenharmony_ci/* 2cabdff1aSopenharmony_ci * LPC utility code 3cabdff1aSopenharmony_ci * Copyright (c) 2006 Justin Ruggles <justin.ruggles@gmail.com> 4cabdff1aSopenharmony_ci * 5cabdff1aSopenharmony_ci * This file is part of FFmpeg. 6cabdff1aSopenharmony_ci * 7cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or 8cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public 9cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either 10cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version. 11cabdff1aSopenharmony_ci * 12cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful, 13cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of 14cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15cabdff1aSopenharmony_ci * Lesser General Public License for more details. 16cabdff1aSopenharmony_ci * 17cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public 18cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software 19cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20cabdff1aSopenharmony_ci */ 21cabdff1aSopenharmony_ci 22cabdff1aSopenharmony_ci#ifndef AVCODEC_LPC_H 23cabdff1aSopenharmony_ci#define AVCODEC_LPC_H 24cabdff1aSopenharmony_ci 25cabdff1aSopenharmony_ci#include <stdint.h> 26cabdff1aSopenharmony_ci#include "libavutil/avassert.h" 27cabdff1aSopenharmony_ci#include "libavutil/lls.h" 28cabdff1aSopenharmony_ci#include "aac_defines.h" 29cabdff1aSopenharmony_ci 30cabdff1aSopenharmony_ci#define ORDER_METHOD_EST 0 31cabdff1aSopenharmony_ci#define ORDER_METHOD_2LEVEL 1 32cabdff1aSopenharmony_ci#define ORDER_METHOD_4LEVEL 2 33cabdff1aSopenharmony_ci#define ORDER_METHOD_8LEVEL 3 34cabdff1aSopenharmony_ci#define ORDER_METHOD_SEARCH 4 35cabdff1aSopenharmony_ci#define ORDER_METHOD_LOG 5 36cabdff1aSopenharmony_ci 37cabdff1aSopenharmony_ci#define MIN_LPC_ORDER 1 38cabdff1aSopenharmony_ci#define MAX_LPC_ORDER 32 39cabdff1aSopenharmony_ci 40cabdff1aSopenharmony_ci/** 41cabdff1aSopenharmony_ci * LPC analysis type 42cabdff1aSopenharmony_ci */ 43cabdff1aSopenharmony_cienum FFLPCType { 44cabdff1aSopenharmony_ci FF_LPC_TYPE_DEFAULT = -1, ///< use the codec default LPC type 45cabdff1aSopenharmony_ci FF_LPC_TYPE_NONE = 0, ///< do not use LPC prediction or use all zero coefficients 46cabdff1aSopenharmony_ci FF_LPC_TYPE_FIXED = 1, ///< fixed LPC coefficients 47cabdff1aSopenharmony_ci FF_LPC_TYPE_LEVINSON = 2, ///< Levinson-Durbin recursion 48cabdff1aSopenharmony_ci FF_LPC_TYPE_CHOLESKY = 3, ///< Cholesky factorization 49cabdff1aSopenharmony_ci FF_LPC_TYPE_NB , ///< Not part of ABI 50cabdff1aSopenharmony_ci}; 51cabdff1aSopenharmony_ci 52cabdff1aSopenharmony_citypedef struct LPCContext { 53cabdff1aSopenharmony_ci int blocksize; 54cabdff1aSopenharmony_ci int max_order; 55cabdff1aSopenharmony_ci enum FFLPCType lpc_type; 56cabdff1aSopenharmony_ci double *windowed_buffer; 57cabdff1aSopenharmony_ci double *windowed_samples; 58cabdff1aSopenharmony_ci 59cabdff1aSopenharmony_ci /** 60cabdff1aSopenharmony_ci * Apply a Welch window to an array of input samples. 61cabdff1aSopenharmony_ci * The output samples have the same scale as the input, but are in double 62cabdff1aSopenharmony_ci * sample format. 63cabdff1aSopenharmony_ci * @param data input samples 64cabdff1aSopenharmony_ci * @param len number of input samples 65cabdff1aSopenharmony_ci * @param w_data output samples 66cabdff1aSopenharmony_ci */ 67cabdff1aSopenharmony_ci void (*lpc_apply_welch_window)(const int32_t *data, int len, 68cabdff1aSopenharmony_ci double *w_data); 69cabdff1aSopenharmony_ci /** 70cabdff1aSopenharmony_ci * Perform autocorrelation on input samples with delay of 0 to lag. 71cabdff1aSopenharmony_ci * @param data input samples. 72cabdff1aSopenharmony_ci * constraints: no alignment needed, but must have at 73cabdff1aSopenharmony_ci * least lag*sizeof(double) valid bytes preceding it, and 74cabdff1aSopenharmony_ci * size must be at least (len+1)*sizeof(double) if data is 75cabdff1aSopenharmony_ci * 16-byte aligned or (len+2)*sizeof(double) if data is 76cabdff1aSopenharmony_ci * unaligned. 77cabdff1aSopenharmony_ci * @param len number of input samples to process 78cabdff1aSopenharmony_ci * @param lag maximum delay to calculate 79cabdff1aSopenharmony_ci * @param autoc output autocorrelation coefficients. 80cabdff1aSopenharmony_ci * constraints: array size must be at least lag+1. 81cabdff1aSopenharmony_ci */ 82cabdff1aSopenharmony_ci void (*lpc_compute_autocorr)(const double *data, int len, int lag, 83cabdff1aSopenharmony_ci double *autoc); 84cabdff1aSopenharmony_ci 85cabdff1aSopenharmony_ci // TODO: these should be allocated to reduce ABI compatibility issues 86cabdff1aSopenharmony_ci LLSModel lls_models[2]; 87cabdff1aSopenharmony_ci} LPCContext; 88cabdff1aSopenharmony_ci 89cabdff1aSopenharmony_ci 90cabdff1aSopenharmony_ci/** 91cabdff1aSopenharmony_ci * Calculate LPC coefficients for multiple orders 92cabdff1aSopenharmony_ci */ 93cabdff1aSopenharmony_ciint ff_lpc_calc_coefs(LPCContext *s, 94cabdff1aSopenharmony_ci const int32_t *samples, int blocksize, int min_order, 95cabdff1aSopenharmony_ci int max_order, int precision, 96cabdff1aSopenharmony_ci int32_t coefs[][MAX_LPC_ORDER], int *shift, 97cabdff1aSopenharmony_ci enum FFLPCType lpc_type, int lpc_passes, 98cabdff1aSopenharmony_ci int omethod, int min_shift, int max_shift, int zero_shift); 99cabdff1aSopenharmony_ci 100cabdff1aSopenharmony_ciint ff_lpc_calc_ref_coefs(LPCContext *s, 101cabdff1aSopenharmony_ci const int32_t *samples, int order, double *ref); 102cabdff1aSopenharmony_ci 103cabdff1aSopenharmony_cidouble ff_lpc_calc_ref_coefs_f(LPCContext *s, const float *samples, int len, 104cabdff1aSopenharmony_ci int order, double *ref); 105cabdff1aSopenharmony_ci 106cabdff1aSopenharmony_ci/** 107cabdff1aSopenharmony_ci * Initialize LPCContext. 108cabdff1aSopenharmony_ci */ 109cabdff1aSopenharmony_ciint ff_lpc_init(LPCContext *s, int blocksize, int max_order, 110cabdff1aSopenharmony_ci enum FFLPCType lpc_type); 111cabdff1aSopenharmony_civoid ff_lpc_init_x86(LPCContext *s); 112cabdff1aSopenharmony_ci 113cabdff1aSopenharmony_ci/** 114cabdff1aSopenharmony_ci * Uninitialize LPCContext. 115cabdff1aSopenharmony_ci */ 116cabdff1aSopenharmony_civoid ff_lpc_end(LPCContext *s); 117cabdff1aSopenharmony_ci 118cabdff1aSopenharmony_ci#if USE_FIXED 119cabdff1aSopenharmony_citypedef int LPC_TYPE; 120cabdff1aSopenharmony_citypedef unsigned LPC_TYPE_U; 121cabdff1aSopenharmony_ci#else 122cabdff1aSopenharmony_ci#ifdef LPC_USE_DOUBLE 123cabdff1aSopenharmony_citypedef double LPC_TYPE; 124cabdff1aSopenharmony_citypedef double LPC_TYPE_U; 125cabdff1aSopenharmony_ci#else 126cabdff1aSopenharmony_citypedef float LPC_TYPE; 127cabdff1aSopenharmony_citypedef float LPC_TYPE_U; 128cabdff1aSopenharmony_ci#endif 129cabdff1aSopenharmony_ci#endif // USE_FIXED 130cabdff1aSopenharmony_ci 131cabdff1aSopenharmony_ci/** 132cabdff1aSopenharmony_ci * Schur recursion. 133cabdff1aSopenharmony_ci * Produces reflection coefficients from autocorrelation data. 134cabdff1aSopenharmony_ci */ 135cabdff1aSopenharmony_cistatic inline void compute_ref_coefs(const LPC_TYPE *autoc, int max_order, 136cabdff1aSopenharmony_ci LPC_TYPE *ref, LPC_TYPE *error) 137cabdff1aSopenharmony_ci{ 138cabdff1aSopenharmony_ci int i, j; 139cabdff1aSopenharmony_ci LPC_TYPE err; 140cabdff1aSopenharmony_ci LPC_TYPE gen0[MAX_LPC_ORDER], gen1[MAX_LPC_ORDER]; 141cabdff1aSopenharmony_ci 142cabdff1aSopenharmony_ci for (i = 0; i < max_order; i++) 143cabdff1aSopenharmony_ci gen0[i] = gen1[i] = autoc[i + 1]; 144cabdff1aSopenharmony_ci 145cabdff1aSopenharmony_ci err = autoc[0]; 146cabdff1aSopenharmony_ci ref[0] = -gen1[0] / ((USE_FIXED || err) ? err : 1); 147cabdff1aSopenharmony_ci err += gen1[0] * ref[0]; 148cabdff1aSopenharmony_ci if (error) 149cabdff1aSopenharmony_ci error[0] = err; 150cabdff1aSopenharmony_ci for (i = 1; i < max_order; i++) { 151cabdff1aSopenharmony_ci for (j = 0; j < max_order - i; j++) { 152cabdff1aSopenharmony_ci gen1[j] = gen1[j + 1] + ref[i - 1] * gen0[j]; 153cabdff1aSopenharmony_ci gen0[j] = gen1[j + 1] * ref[i - 1] + gen0[j]; 154cabdff1aSopenharmony_ci } 155cabdff1aSopenharmony_ci ref[i] = -gen1[0] / ((USE_FIXED || err) ? err : 1); 156cabdff1aSopenharmony_ci err += gen1[0] * ref[i]; 157cabdff1aSopenharmony_ci if (error) 158cabdff1aSopenharmony_ci error[i] = err; 159cabdff1aSopenharmony_ci } 160cabdff1aSopenharmony_ci} 161cabdff1aSopenharmony_ci 162cabdff1aSopenharmony_ci/** 163cabdff1aSopenharmony_ci * Levinson-Durbin recursion. 164cabdff1aSopenharmony_ci * Produce LPC coefficients from autocorrelation data. 165cabdff1aSopenharmony_ci */ 166cabdff1aSopenharmony_cistatic inline int AAC_RENAME(compute_lpc_coefs)(const LPC_TYPE *autoc, int max_order, 167cabdff1aSopenharmony_ci LPC_TYPE *lpc, int lpc_stride, int fail, 168cabdff1aSopenharmony_ci int normalize) 169cabdff1aSopenharmony_ci{ 170cabdff1aSopenharmony_ci int i, j; 171cabdff1aSopenharmony_ci LPC_TYPE err = 0; 172cabdff1aSopenharmony_ci LPC_TYPE *lpc_last = lpc; 173cabdff1aSopenharmony_ci 174cabdff1aSopenharmony_ci av_assert2(normalize || !fail); 175cabdff1aSopenharmony_ci 176cabdff1aSopenharmony_ci if (normalize) 177cabdff1aSopenharmony_ci err = *autoc++; 178cabdff1aSopenharmony_ci 179cabdff1aSopenharmony_ci if (fail && (autoc[max_order - 1] == 0 || err <= 0)) 180cabdff1aSopenharmony_ci return -1; 181cabdff1aSopenharmony_ci 182cabdff1aSopenharmony_ci for(i=0; i<max_order; i++) { 183cabdff1aSopenharmony_ci LPC_TYPE r = AAC_SRA_R(-autoc[i], 5); 184cabdff1aSopenharmony_ci 185cabdff1aSopenharmony_ci if (normalize) { 186cabdff1aSopenharmony_ci for(j=0; j<i; j++) 187cabdff1aSopenharmony_ci r -= lpc_last[j] * autoc[i-j-1]; 188cabdff1aSopenharmony_ci 189cabdff1aSopenharmony_ci if (err) 190cabdff1aSopenharmony_ci r /= err; 191cabdff1aSopenharmony_ci err *= FIXR(1.0) - (r * r); 192cabdff1aSopenharmony_ci } 193cabdff1aSopenharmony_ci 194cabdff1aSopenharmony_ci lpc[i] = r; 195cabdff1aSopenharmony_ci 196cabdff1aSopenharmony_ci for(j=0; j < (i+1)>>1; j++) { 197cabdff1aSopenharmony_ci LPC_TYPE f = lpc_last[ j]; 198cabdff1aSopenharmony_ci LPC_TYPE b = lpc_last[i-1-j]; 199cabdff1aSopenharmony_ci lpc[ j] = f + (LPC_TYPE_U)AAC_MUL26(r, b); 200cabdff1aSopenharmony_ci lpc[i-1-j] = b + (LPC_TYPE_U)AAC_MUL26(r, f); 201cabdff1aSopenharmony_ci } 202cabdff1aSopenharmony_ci 203cabdff1aSopenharmony_ci if (fail && err < 0) 204cabdff1aSopenharmony_ci return -1; 205cabdff1aSopenharmony_ci 206cabdff1aSopenharmony_ci lpc_last = lpc; 207cabdff1aSopenharmony_ci lpc += lpc_stride; 208cabdff1aSopenharmony_ci } 209cabdff1aSopenharmony_ci 210cabdff1aSopenharmony_ci return 0; 211cabdff1aSopenharmony_ci} 212cabdff1aSopenharmony_ci 213cabdff1aSopenharmony_ci#endif /* AVCODEC_LPC_H */ 214