Lines Matching defs:order
65 static inline void silk_stabilize_lsf(int16_t nlsf[16], int order, const uint16_t min_delta[17])
70 for (i = 0; i < order+1; i++) {
72 int high = i != order ? nlsf[i] : 32768;
90 } else if (k == order) {
92 nlsf[order-1] = 32768 - min_delta[order];
103 for (i = order; i > k; i--)
120 for (i = 1; i < order; i++) {
130 for (i = 1; i < order; i++)
134 if (nlsf[order-1] > 32768 - min_delta[order])
135 nlsf[order-1] = 32768 - min_delta[order];
136 for (i = order-2; i >= 0; i--)
143 static inline int silk_is_lpc_stable(const int16_t lpc[16], int order)
151 for (k = 0; k < order; k++) {
160 for (k = order - 1; 1; k--) {
218 static void silk_lsf2lpc(const int16_t nlsf[16], float lpcf[16], int order)
227 for (k = 0; k < order; k++) {
230 int k2 = (order == 10) ? ff_silk_lsf_ordering_nbmb[k] : ff_silk_lsf_ordering_wb[k];
238 silk_lsp2poly(lsp , p, order >> 1);
239 silk_lsp2poly(lsp + 1, q, order >> 1);
242 for (k = 0; k < order>>1; k++) {
246 lpc32[order-k-1] = q_tmp - p_tmp;
253 for (j = 0, k = 0; j < order; j++) {
269 for (k = 0; k < order; k++) {
278 for (k = 0; k < order; k++) {
284 for (k = 0; k < order; k++)
290 for (i = 1; i <= 16 && !silk_is_lpc_stable(lpc, order); i++) {
294 for (k = 0; k < order; k++) {
301 for (i = 0; i < order; i++)
311 int order; // order of the LP polynomial; 10 for NB/MB and 16 for WB
316 *lpc_order = order = s->wb ? 16 : 10;
320 for (i = 0; i < order; i++) {
331 for (i = order - 1; i >= 0; i--) {
339 if (i + 1 < order) {
347 for (i = 0; i < order; i++) {
356 next = i + 1 < order ? codebook[i + 1] : 256;
370 silk_stabilize_lsf(nlsf, order, s->wb ? ff_silk_lsf_min_spacing_wb :
382 for (i = 0; i < order; i++)
385 silk_lsf2lpc(nlsf_leadin, lpc_leadin, order);
392 silk_lsf2lpc(nlsf, lpc, order);
395 silk_lsf2lpc(nlsf, lpc, order);
398 memcpy(frame->nlsf, nlsf, order * sizeof(nlsf[0]));
399 memcpy(frame->lpc, lpc, order * sizeof(lpc[0]));
516 int order; // order of the LPC coefficients
593 silk_decode_lpc(s, frame, rc, lpc_leadin, lpc_body, &order, &has_lpc_leadin, voiced);
700 for (k = 0; k < order; k++)
723 for (k = 1; k <= order; k++)