| /external/libvorbis/lib/ |
| lsp.c | 25 /* Note that the lpc-lsp conversion finds the roots of polynomial with
323 /* eval the polynomial and its first two derivatives */
|
| /external/libvpx/libvpx/third_party/libyuv/include/libyuv/ |
| planar_functions.h | 255 // Apply a 3 term polynomial to ARGB values.
261 // A polynomial approximation can be dirived using software such as 'R'.
|
| /external/libyuv/files/include/libyuv/ |
| planar_functions.h | 256 // Apply a 3 term polynomial to ARGB values.
262 // A polynomial approximation can be dirived using software such as 'R'.
|
| /frameworks/av/media/libeffects/lvm/lib/SpectrumAnalyzer/src/ |
| LVPSA_Control.c | 514 * Calculate the cosine by a polynomial expansion using the equation:
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_utilities_poly.h | 30 * \defgroup LMPolynomial (LM) Polynomial utilities (solvers, arithmetic, evaluation, etc.)
259 degree polynomial goes first and the smaller ones
|
| /prebuilts/go/darwin-x86/src/math/ |
| lgamma.go | 38 // 2. Polynomial approximation of lgamma around its
43 // poly(z) is a 14 degree polynomial.
|
| /prebuilts/go/linux-x86/src/math/ |
| lgamma.go | 38 // 2. Polynomial approximation of lgamma around its
43 // poly(z) is a 14 degree polynomial.
|
| /device/google/dragon/audio/hal/dsp/ |
| drc_kernel.c | 285 * Polynomial of the form y = a + b*x + c*x^2 + d*x^3 + e*x^4
292 /* All of these coefficients were derived for 4th order polynomial curve
369 /* Compute adaptive release curve using 4th order polynomial.
370 * Normal values for the polynomial coefficients would create a
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/integration/ |
| LegendreGaussIntegrator.java | 45 * Legendre polynomial. The weights a<sub>i</sub> of the quadrature formula
|
| /external/boringssl/src/crypto/cmac/ |
| cmac.c | 126 * with a hard-coded reduction polynomial and sets |out| as x times the
|
| /external/boringssl/src/crypto/ec/ |
| ec_montgomery.c | 64 * The elliptic curve binary polynomial software is originally written by
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/docs/source/ |
| intro.rst | 17 generate a Python function for the selected polynomial or an instance of the
|
| /external/compiler-rt/lib/builtins/ |
| divdf3.c | 81 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
|
| divsf3.c | 81 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
|
| /external/flac/include/FLAC/ |
| format.h | 270 FLAC__SUBFRAME_TYPE_FIXED = 2, /**< fixed polynomial prediction */
303 /**< The polynomial order. */
440 /**< CRC-8 (polynomial = x^8 + x^2 + x^1 + x^0, initialized with 0)
462 /**< CRC-16 (polynomial = x^16 + x^15 + x^2 + x^0, initialized with
[all...] |
| /external/libopus/celt/ |
| mathops.h | 226 /* Atan approximation using a 4th order polynomial. Input is in Q15 format
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/ |
| filter_functions.c | 172 /* Get LPC polynomial */
|
| /frameworks/av/services/audioflinger/ |
| AudioResamplerFirGen.h | 186 * For the intermediate range 3.75 < x < 15, we use minimax polynomial fit.
212 /* Polynomial evaluation of A + Bx + Cx^2 + Dx^3 + ...
240 /* Polynomial evaluation of A + Bx + Cx^2 + Dx^3 + ...
308 * A better solution is to use precise minimax polynomial fits.
|
| /frameworks/native/libs/input/ |
| VelocityTracker.cpp | 394 * Solves a linear least squares problem to obtain a N degree polynomial that fits
402 * The output is a vector B with indices 0..n that describes a polynomial
411 * the polynomial. It is a good idea to choose weights that diminish the importance
595 // Calculate a least squares polynomial fit.
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/tools/ |
| config.hpp | 182 // The maximum order of polynomial that will be evaluated
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| HermiteInterpolator.java | 141 * with the slope of the tangent m1 at p1 and m2 at p2, the polynomial of cubic Hermite curve
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/exception/util/ |
| LocalizedFormats.java | 105 FUNCTION_NOT_POLYNOMIAL("function is not polynomial"),
156 NON_POSITIVE_POLYNOMIAL_DEGREE("polynomial degree must be positive: degree={0}"),
249 POLYNOMIAL_INTERPOLANTS_MISMATCH_SEGMENTS("number of polynomial interpolants must match the number of segments ({0} != {1} - 1)"),
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| FastMath.java | 686 * Compute z as the exponential of the remaining bits by a polynomial minus one
782 /* Compute z = exp(epsilon) - 1.0 via a minimax polynomial. z has
787 /* Remez generated polynomial. Converges on the interval [0, 2^-10], error
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| lsp_az.cpp | 137 f = pointer to the polynomial of type Word32 to be generated
143 buffer pointed to by f contains the polynomial generated
160 This function finds the polynomial F1(z) or F2(z) from the LSPs. If the LSP
309 f = pointer to the polynomial of type Word32 to be generated
315 buffer pointed to by f contains the polynomial generated
|
| /external/aac/libFDK/src/ |
| fixpoint_math.cpp | 131 description: Delivers the Logarithm Dualis ld(op)/LD_DATA_SCALING with polynomial approximation.
664 /* Evaluate taylor polynomial which approximates 2^x */
679 /* "+ 1" compensates fMultAddDiv2() of the polynomial evaluation above. */
|
