Lines Matching defs:order
62 int order, // LP FIR filter order
69 int half = order >> 1;
70 if (order & 1) { // order is odd, center = half + 0.5
76 } else { // order is even, center = half
83 for (; i <= order; i++) // symmetric FIR
84 coef[i] = coef[order - i];
93 * convolution of coef[order + 1] and data[length] up-sampled by a factor
100 int order, // filter order
105 if ((order < 0) || (inc_coef < 1) || (length < 1))
109 double *coef_end = coef + order;
155 order = (fold << 4) - 2; // filter order = fold * 16 - 2
156 coef = new double[order + 1];
157 sinc_coef(fold, order, coef); // required bandwidth = PI/fold
159 if (up > 1) { // need (order/up) states
160 num_state = (order + up - 1) / up;
165 num_state = order;
166 state = new double[order]; // need order states
169 delay = (order + 1) >> 1; // assuming symmetric FIR
197 int init_size = (size <= order)? size : order;
200 convolve(coef + i + 1, state + i, order - i));
202 *out_ptr++ = double2short(convolve(coef, in_buf + i - order,
203 order + 1));
265 order - coef_offset, up, state, num_state));
272 order - j, up, in_buf, i) + poly_conv(
273 coef + coef_offset, order - coef_offset, up, state,
282 order - j, up, in_buf, size) + poly_conv(
283 coef + coef_offset, order - coef_offset, up, state,
356 order - coef_offset, up, state, num_state));
364 order - j, up, in_buf, i) + poly_conv(
365 coef + coef_offset, order - coef_offset, up, state,
374 *out++ = double2short(up * (poly_conv(coef + j, order - j, up,
376 order - coef_offset, up, state, num_state)));