/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/ilbc/ |
H A D | state_search.h | 33 int16_t *residual, /* (i) target residual vector */
|
H A D | state_search.c | 32 int16_t *residual, /* (i) target residual vector */ 51 max = WebRtcSpl_MaxAbsValueW16(residual, iLBCenc_inst->state_short_len); 59 /* Copy the residual to a temporary buffer that we can filter 62 WEBRTC_SPL_MEMCPY_W16(residualLong, residual, iLBCenc_inst->state_short_len); 27 WebRtcIlbcfix_StateSearch( iLBC_Enc_Inst_t *iLBCenc_inst, iLBC_bits *iLBC_encbits, int16_t *residual, int16_t *syntDenum, int16_t *weightDenum ) argument
|
H A D | encode.c | 56 int16_t *residual; local 80 residual = &iLBCenc_inst->lpc_buffer[LPC_LOOKBACK+BLOCKL_MAX-iLBCenc_inst->blockl]; 82 decresidual = residual; /* Already encoded residual is overwritten by the decoded version */ 84 reverseDecresidual = reverseResidual; /* Already encoded residual is overwritten by the decoded version */ 125 /* high pass filtering of input signal and scale down the residual (*0.5) */ 137 /* inverse filter to get residual */ 140 &data[n*SUBL], &residual[n*SUBL], 150 iLBCbits_inst->startIdx = WebRtcIlbcfix_FrameClassify(iLBCenc_inst,residual); 156 max=WebRtcSpl_MaxAbsValueW16(&residual[inde [all...] |
/external/aac/libFDK/include/ |
H A D | FDK_trigFcts.h | 142 * Returns delta x residual. 146 FIXP_DBL residual; local 152 residual = fMult(x, FL2FXCONST_DBL(1.0/M_PI)); 153 s = ((LONG)residual) >> shift; 155 residual &= ( (1<<shift) - 1 ); 156 residual = fMult(residual, FL2FXCONST_DBL(M_PI/4.0)) << 2; 157 residual <<= scale; 202 return residual; 215 FIXP_DBL residual, error local [all...] |
/external/ceres-solver/examples/ |
H A D | powell.cc | 61 T* residual) const { 63 residual[0] = x1[0] + T(10.0) * x2[0]; 71 T* residual) const { 73 residual[0] = T(sqrt(5.0)) * (x3[0] - x4[0]); 81 T* residual) const { 83 residual[0] = (x2[0] - T(2.0) * x4[0]) * (x2[0] - T(2.0) * x4[0]); 91 T* residual) const { 93 residual[0] = T(sqrt(10.0)) * (x1[0] - x4[0]) * (x1[0] - x4[0]); 111 // Add residual terms to the problem using the using the autodiff
|
H A D | more_garbow_hillstrom.cc | 79 bool operator()(const T* const x, T* residual) const { 87 residual[0] = T(10.0) * (x2 - x1 * x1); member in namespace:ceres::examples 88 residual[1] = T(1.0) - x1; member in namespace:ceres::examples 102 residual[0] = T(-13.0) + x1 + ((T(5.0) - x2) * x2 - T(2.0)) * x2; member in namespace:ceres::examples 103 residual[1] = T(-29.0) + x1 + ((x2 + T(1.0)) * x2 - T(14.0)) * x2; member in namespace:ceres::examples 117 residual[0] = T(10000.0) * x1 * x2 - T(1.0); member in namespace:ceres::examples 118 residual[1] = exp(-x1) + exp(-x2) - T(1.0001); member in namespace:ceres::examples 131 residual[0] = x1 - T(1000000.0); member in namespace:ceres::examples 132 residual[1] = x2 - T(0.000002); member in namespace:ceres::examples 133 residual[ member in namespace:ceres::examples 146 residual[0] = T(1.5) - x1 * (T(1.0) - x2); member in namespace:ceres::examples 147 residual[1] = T(2.25) - x1 * (T(1.0) - x2 * x2); member in namespace:ceres::examples 148 residual[2] = T(2.625) - x1 * (T(1.0) - x2 * x2 * x2); member in namespace:ceres::examples 182 residual[0] = T(10.0) * (x3 - T(10.0) * theta); member in namespace:ceres::examples 183 residual[1] = T(10.0) * (sqrt(x1 * x1 + x2 * x2) - T(1.0)); member in namespace:ceres::examples 184 residual[2] = x3; member in namespace:ceres::examples [all...] |
H A D | helloworld.cc | 45 // A templated cost functor that implements the residual r = 10 - 50 template <typename T> bool operator()(const T* const x, T* residual) const { 51 residual[0] = T(10.0) - x[0]; 67 // Set up the only cost function (also known as residual). This uses
|
H A D | helloworld_numeric_diff.cc | 44 // A cost functor that implements the residual r = 10 - x. 46 bool operator()(const double* const x, double* residual) const { 47 residual[0] = 10.0 - x[0]; 63 // Set up the only cost function (also known as residual). This uses
|
H A D | circle_fit.cc | 71 // The cost for a single sample. The returned residual is related to the 82 T* residual) const { 92 // residual[0] = r - sqrt(xp*xp + yp*yp); 100 residual[0] = r*r - xp*xp - yp*yp;
|
H A D | curve_fitting.cc | 127 T* residual) const { 128 residual[0] = T(y_) - exp(m[0] * T(x_) + c[0]);
|
/external/flac/libFLAC/include/private/ |
H A D | lpc.h | 130 * Compute the residual signal obtained from sutracting the predicted 138 * OUT residual[0,data_len-1] residual signal 140 void FLAC__lpc_compute_residual_from_qlp_coefficients(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[]); 141 void FLAC__lpc_compute_residual_from_qlp_coefficients_wide(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[]); 145 void FLAC__lpc_compute_residual_from_qlp_coefficients_asm_ia32(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[]); 146 void FLAC__lpc_compute_residual_from_qlp_coefficients_asm_ia32_mmx(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[]); 156 * Restore the original signal by summing the residual and the 159 * IN residual[0,data_len-1] residual signa [all...] |
H A D | fixed.h | 46 * of the residual signal for each order. The _wide() version uses 72 * Compute the residual signal obtained from sutracting the predicted 78 * OUT residual[0,data_len-1] residual signal 80 void FLAC__fixed_compute_residual(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]); 85 * Restore the original signal by summing the residual and the 88 * IN residual[0,data_len-1] residual signal 95 void FLAC__fixed_restore_signal(const FLAC__int32 residual[], unsigned data_len, unsigned order, FLAC__int32 data[]);
|
/external/flac/libFLAC/ |
H A D | fixed.c | 58 /* rbps stands for residual bits per sample 256 /* Estimate the expected number of bits per residual signal sample. */ 257 /* 'total_error*' is linearly related to the variance of the residual */ 318 /* Estimate the expected number of bits per residual signal sample. */ 319 /* 'total_error*' is linearly related to the variance of the residual */ 352 void FLAC__fixed_compute_residual(const FLAC__int32 data[], unsigned data_len, unsigned order, FLAC__int32 residual[]) argument 359 FLAC__ASSERT(sizeof(residual[0]) == sizeof(data[0])); 360 memcpy(residual, data, sizeof(residual[0])*data_len); 364 residual[ 395 FLAC__fixed_restore_signal(const FLAC__int32 residual[], unsigned data_len, unsigned order, FLAC__int32 data[]) argument [all...] |
H A D | lpc.c | 265 void FLAC__lpc_compute_residual_from_qlp_coefficients(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[]) argument 296 *(residual++) = *(data++) - (sum >> lp_quantization); 304 residual[i] = data[i] - (sum >> lp_quantization); 339 residual[i] = data[i] - (sum >> lp_quantization); 356 residual[i] = data[i] - (sum >> lp_quantization); 374 residual[i] = data[i] - (sum >> lp_quantization); 389 residual[i] = data[i] - (sum >> lp_quantization); 407 residual[i] = data[i] - (sum >> lp_quantization); 420 residual[i] = data[i] - (sum >> lp_quantization); 434 residual[ 531 FLAC__lpc_compute_residual_from_qlp_coefficients_wide(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[]) argument 795 FLAC__lpc_restore_signal(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[]) argument 1063 FLAC__lpc_restore_signal_wide(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[]) argument [all...] |
/external/aac/libFDK/src/ |
H A D | FDK_trigFcts.cpp | 298 FIXP_DBL residual, error, sine, cosine; local 300 residual = fixp_sin_cos_residual_inline(x, scale, &sine, &cosine); 301 error = fMult(sine, residual); 308 FIXP_DBL residual, error, sine, cosine; local 310 residual = fixp_sin_cos_residual_inline(x, scale, &sine, &cosine); 311 error = fMult(cosine, residual); 318 FIXP_DBL residual, error0, error1, sine, cosine; local 320 residual = fixp_sin_cos_residual_inline(x, scale, &sine, &cosine); 321 error0 = fMult(sine, residual); 322 error1 = fMult(cosine, residual); [all...] |
/external/chromium_org/third_party/webrtc/modules/remote_bitrate_estimator/ |
H A D | overuse_detector.cc | 182 const double residual = t_ts_delta - slope_*h[0] - offset_; local 188 if (fabs(residual) < 3 * sqrt(var_noise_)) { 189 UpdateNoiseEstimate(residual, min_frame_period, stable_state); 215 slope_ = slope_ + K[0] * residual; 217 offset_ = offset_ + K[1] * residual; 236 void OveruseDetector::UpdateNoiseEstimate(double residual, argument 253 + (1 - beta) * residual; 255 + (1 - beta) * (avg_noise_ - residual) * (avg_noise_ - residual);
|
/external/compiler-rt/lib/builtins/ |
H A D | divdf3.c | 139 // In either case, we are going to compute a residual of the form 151 rep_t residual; local 153 residual = (aSignificand << 53) - quotient * bSignificand; 157 residual = (aSignificand << 52) - quotient * bSignificand; 174 const bool round = (residual << 1) > bSignificand;
|
H A D | divsf3.c | 124 // In either case, we are going to compute a residual of the form 136 rep_t residual; local 138 residual = (aSignificand << 24) - quotient * bSignificand; 142 residual = (aSignificand << 23) - quotient * bSignificand; 159 const bool round = (residual << 1) > bSignificand;
|
H A D | divtf3.c | 153 // In either case, we are going to compute a residual of the form 165 rep_t residual; local 170 residual = (aSignificand << 113) - qb; 175 residual = (aSignificand << 112) - qb; 190 const bool round = (residual << 1) >= bSignificand;
|
/external/ceres-solver/internal/ceres/ |
H A D | autodiff_test.cc | 517 double residual = 0; local 532 functor, parameters, 1, &residual, jacobians))); 533 EXPECT_EQ(residual, pow(2, num_variables + 1) - 2); 543 functor, parameters, 1, &residual, jacobians))); 544 EXPECT_EQ(residual, pow(2, num_variables + 1) - 2); 554 functor, parameters, 1, &residual, jacobians))); 555 EXPECT_EQ(residual, pow(2, num_variables + 1) - 2); 565 functor, parameters, 1, &residual, jacobians))); 566 EXPECT_EQ(residual, pow(2, num_variables + 1) - 2); 576 functor, parameters, 1, &residual, jacobian [all...] |
H A D | solver_impl_test.cc | 52 T* residual) const { 54 residual[0] = T(10.0) - *x +
|
H A D | gradient_checking_cost_function_test.cc | 149 double residual; local 154 // Since residual is one dimensional the jacobians have the same 174 &residual, 176 EXPECT_EQ(original_residual, residual); 205 double residual; local 208 // Since residual is one dimensional the jacobians have the same size as the 233 &residual, 251 &residual,
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | ConjugateGradient.h | 43 VectorType residual = rhs - mat * x; //initial residual local 54 RealScalar residualNorm2 = residual.squaredNorm(); 63 p = precond.solve(residual); //initial search direction 66 RealScalar absNew = numext::real(residual.dot(p)); // the square of the absolute value of r scaled by invM 74 residual -= alpha * tmp; // update residue 76 residualNorm2 = residual.squaredNorm(); 80 z = precond.solve(residual); // approximately solve for "A z = residual" 83 absNew = numext::real(residual [all...] |
/external/chromium_org/third_party/webrtc/system_wrappers/source/ |
H A D | timestamp_extrapolator.cc | 106 double residual = local 109 if (DelayChangeDetection(residual) && 127 _w[0] = _w[0] + K[0] * residual; 128 _w[1] = _w[1] + K[1] * residual;
|
/external/kernel-headers/original/uapi/linux/ |
H A D | virtio_blk.h | 123 __u32 residual; member in struct:virtio_scsi_inhdr
|