/external/drrickorang/LoopbackApp/app/src/main/java/org/drrickorang/loopback/ |
Utilities.java | 32 double coefficient; local 34 coefficient = (Constant.TWO_PI * i) / (length - 1); 35 samples[i] *= alpha - beta * Math.cos(coefficient);
|
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
pitch_filter_mips.c | 19 const int16_t* coefficient, 40 "lwl %[coef1], 3(%[coefficient]) \n\t" 41 "lwl %[coef2], 7(%[coefficient]) \n\t" 42 "lwl %[coef3], 11(%[coefficient]) \n\t" 43 "lwl %[coef4], 15(%[coefficient]) \n\t" 44 "lwr %[coef1], 0(%[coefficient]) \n\t" 45 "lwr %[coef2], 4(%[coefficient]) \n\t" 46 "lwr %[coef3], 8(%[coefficient]) \n\t" 47 "lwr %[coef4], 12(%[coefficient]) \n\t" 48 "lhu %[coef5], 16(%[coefficient]) \n\t [all...] |
filterbank_internal.h | 23 * coefficient: Input. 28 const int16_t* coefficient, 34 const int16_t* coefficient, 40 const int16_t* coefficient,
|
pitch_filter_c.c | 25 const int16_t* coefficient, 38 tmpW32 += ubufQQpos2[*index2 + j] * coefficient[j];
|
filterbanks.c | 94 const int16_t *coefficient, 125 :[coeff]"r"(coefficient), 132 a1 = WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[5], state0) + 133 (WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[4], state0) >> 16); 134 b1 = WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[7], state1) + 135 (WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[6], state1) >> 16); 138 a2 = WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[1], state0) + 139 (WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[0], state0) >> 16); 140 b2 = WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[3], state1) + 141 (WEBRTC_SPL_MUL_16_32_RSFT16(coefficient[2], state1) >> 16) [all...] |
pitch_estimator.h | 46 const int16_t* coefficient,
|
filterbanks_mips.c | 108 const int16_t* coefficient, 140 : [coeff_ptr] "r" (coefficient), [state0] "r" (state0),
|
pitch_filter_armv6.S | 28 @ const int16_t* coefficient, 56 ldr r9, [sp, #48] @ coefficient 66 @ r9: &coefficient[] 74 ldr r4, [r9], #4 @ coefficient[0, 1] 86 ldrh r4, [r9], #-16 @ r9 back to &coefficient[0].
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/pkcs/ |
RSAPrivateKey.java | 25 private BigInteger coefficient; field in class:RSAPrivateKey 59 BigInteger coefficient) 69 this.coefficient = coefficient; 91 coefficient = ((ASN1Integer)e.nextElement()).getValue(); 141 return coefficient; 156 * coefficient INTEGER, -- (inverse of q) mod p
|
RSAPrivateKeyStructure.java | 28 private BigInteger coefficient; field in class:RSAPrivateKeyStructure 61 BigInteger coefficient) 71 this.coefficient = coefficient; 93 coefficient = ((ASN1Integer)e.nextElement()).getValue(); 143 return coefficient; 158 * coefficient INTEGER, -- (inverse of q) mod p
|
/prebuilts/go/darwin-x86/src/hash/crc32/ |
example_test.go | 17 // most significant bit represents the coefficient of x? and the least significant 18 // bit represents the coefficient of x??¹ (the coefficient for x? is implicit).
|
/prebuilts/go/linux-x86/src/hash/crc32/ |
example_test.go | 17 // most significant bit represents the coefficient of x? and the least significant 18 // bit represents the coefficient of x??¹ (the coefficient for x? is implicit).
|
/external/deqp/modules/glshared/ |
glsCalibration.hpp | 42 float coefficient; member in struct:deqp::gls::LineParameters 44 LineParameters (float offset_, float coefficient_) : offset(offset_), coefficient(coefficient_) {} 57 float coefficient; member in struct:deqp::gls::LineParametersWithConfidence
|
glsCalibration.cpp | 84 // \note If there are no data point pairs with differing x values, the coefficient variable will stay zero as initialized. 86 result.coefficient = destructiveMedian(pairwiseCoefficients); 88 // Compute the offsets corresponding to the median coefficient, for all data points. 90 pointwiseOffsets.push_back(dataPoints[i].y() - result.coefficient*dataPoints[i].x()); 156 result.coefficient = linearSample(medianSlopes, 0.5f); 158 // Compute the offsets corresponding to the median coefficient, for all data points. 160 pointwiseOffsets.push_back(dataPoints[i].y() - result.coefficient*dataPoints[i].x()); 363 const float coeffEpsilon = 0.001f; // Coefficient must be large enough (and positive) to be considered sensible. 373 if (estimatorLine.coefficient < coeffEpsilon) // Coefficient not good for sensible estimation; increase call count enough to get a reasonably different value [all...] |
/external/autotest/client/deps/glbench/src/ |
testbase.h | 27 // coefficient is multiplied (if inverse is false) or divided (if inverse is 31 // coefficient = width * height (measured in pixels), inverse = true 34 // coefficient = 1, inverse = false 38 double coefficient,
|
/external/libxcam/modules/isp/ |
aiq3a_utils.cpp | 83 double coefficient = 0.0; local 93 coefficient = pow (2, (16 - atomisp_params.wb_config->integer_bits)); 94 wb->r_gain = atomisp_params.wb_config->r / coefficient; 95 wb->gr_gain = atomisp_params.wb_config->gr / coefficient; 96 wb->gb_gain = atomisp_params.wb_config->gb / coefficient; 97 wb->b_gain = atomisp_params.wb_config->b / coefficient; 139 coefficient = pow (2, atomisp_params.yuv2rgb_cc_config->fraction_bits); 141 tmp_matrix [i] = atomisp_params.yuv2rgb_cc_config->matrix [i] / coefficient; 171 coefficient = pow (2, (13 - atomisp_params.macc_config->color_effect)); 173 macc->table[i] = (double)atomisp_params.macc_table->data[i] / coefficient; [all...] |
/external/pdfium/fxbarcode/common/reedsolomon/ |
BC_ReedSolomonGF256.cpp | 79 int32_t coefficient, 85 if (coefficient == 0) { 92 coefficients[0] = coefficient;
|
BC_ReedSolomonGF256.h | 27 int32_t coefficient,
|
BC_ReedSolomonGF256Poly.h | 37 int32_t coefficient) const;
|
BC_ReedSolomonGF256Poly.cpp | 184 int32_t coefficient) const { 187 if (coefficient == 0) 193 product[i] = m_field->Multiply(m_coefficients[i], coefficient);
|
/external/syslinux/gpxe/src/crypto/ |
md5.c | 33 u8 coefficient; member in struct:md5_step 60 .coefficient = 1, 65 .coefficient = 5, 70 .coefficient = 3, 75 .coefficient = 7, 120 g = ( ( i * step->coefficient + step->constant ) & 0xf );
|
/external/adhd/cras/src/server/ |
audio_thread.h | 179 const float *coefficient);
|
cras_fmt_conv.h | 32 * coefficient - Float array of length N * N representing the conversion 33 * matrix, where matrix[i][j] corresponds to coefficient[i * N + j] 37 const float *coefficient);
|
/external/ImageMagick/MagickCore/ |
resize.c | 100 coefficient[7]; /* cubic coefficents for BC-cubic filters */ 243 return(resize_filter->coefficient[0]+x*(x* 244 (resize_filter->coefficient[1]+x*resize_filter->coefficient[2]))); 246 return(resize_filter->coefficient[3]+x*(resize_filter->coefficient[4]+x* 247 (resize_filter->coefficient[5]+x*resize_filter->coefficient[6]))); 283 return(exp((double)(-resize_filter->coefficient[1]*x*x))); 342 return(resize_filter->coefficient[1]*I0(resize_filter->coefficient[0] 98 coefficient[7]; \/* cubic coefficents for BC-cubic filters *\/ member in struct:_ResizeFilter [all...] |
/external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
stateless_random_ops.cc | 198 auto coefficient = [&](int i) { local 208 auto p = coefficient(0); 210 p = b->Add(coefficient(i), b->Mul(p, w));
|