69 for (n=0; n<
len; n++) {
73 if ((state_first)&&(n==
SUBL)){
81 }
else if ((state_first==0)&&
100 toQ =
in[n]-syntOut[n];
159 memcpy(
tmp, residual,
len*
sizeof(
float));
163 for (k=0; k<
len; k++) {
164 fout[k] += fout[k+
len];
170 for (k=1; k<
len; k++) {
172 if (fout[k]*fout[k] > maxVal*maxVal){
176 maxVal=(float)fabs(maxVal);
183 maxVal = (float)log10(maxVal);
190 qmax = (float)pow(10,maxVal);
191 scal = (float)(4.5)/qmax;
192 for (k=0; k<
len; k++){
199 weightDenum,idxVec,
len, state_first);
void StateSearchW(iLBC_Enc_Inst_t *iLBCenc_inst, float *residual, float *syntDenum, float *weightDenum, int *idxForMax, int *idxVec, int len, int state_first)
void AbsQuantW(iLBC_Enc_Inst_t *iLBCenc_inst, float *in, float *syntDenum, float *weightDenum, int *out, int len, int state_first)
void ZeroPoleFilter(float *In, float *ZeroCoef, float *PoleCoef, int lengthInOut, int orderCoef, float *Out)
void AllPoleFilter(float *InOut, float *Coef, int lengthInOut, int orderCoef)
static int len(struct ast_channel *chan, const char *cmd, char *data, char *buf, size_t buflen)
void sort_sq(float *xq, int *index, float x, const float *cb, int cb_size)
#define STATE_SHORT_LEN_30MS