HomeSort by relevance Sort by last modified time
    Searched full:polynomial (Results 51 - 75 of 305) sorted by null

1 23 4 5 6 7 8 91011>>

  /frameworks/av/media/libeffects/lvm/lib/Common/src/
LVM_Power10.c 29 /* This function calculates 10X using an 11th order polynomial. It uses */
30 /* the following table of 32-bit integer polynomial coefficients: */
  /frameworks/av/media/libeffects/lvm/lib/Reverb/src/
LVREV_Tables.c 54 size parameters. These polynomial coefficients are calculated experimentally.
66 first values is used to get polynomial set for given room size,
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
ECCurve.java 205 * x<sup>k</sup> + 1</code> represents the reduction polynomial
209 * represents the reduction polynomial <code>f(z)</code>.<br>
217 * represents the reduction polynomial <code>f(z)</code>.<br>
225 * represents the reduction polynomial <code>f(z)</code>.<br>
258 * Constructor for Trinomial Polynomial Basis (TPB).
263 * polynomial <code>f(z)</code>.
281 * Constructor for Trinomial Polynomial Basis (TPB).
286 * polynomial <code>f(z)</code>.
309 * Constructor for Pentanomial Polynomial Basis (PPB).
314 * represents the reduction polynomial <code>f(z)</code>
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/src/
k_sin.c 26 * odd polynomial is not evaluated in a way that preserves -0.
28 * 3. sin(x) is approximated by a polynomial of degree 13 on
k_log.h 23 * term of the polynomial are done by the caller for increased accuracy
36 * a polynomial of degree 14 to approximate R The maximum error
37 * of this polynomial approximation is bounded by 2**-58.45. In
k_tan.c 26 * odd polynomial is not evaluated in a way that preserves -0.
28 * 3. tan(x) is approximated by a odd polynomial of degree 27 on
  /external/chromium_org/crypto/
ghash.h 10 // GaloisHash implements the polynomial authenticator part of GCM as specified
22 // WARNING: do not use this as a generic authenticator. Polynomial
ghash.cc 14 // GaloisHash is a polynomial authenticator that works in GF(2^128).
155 // becomes a term of x^128. This is greater than the irreducible polynomial
156 // so the result has to be reduced. The irreducible polynomial is
203 // These terms have to be eliminated by dividing by the irreducible polynomial.
204 // In GHASH, the polynomial is such that all the terms occur in the
  /external/chromium_org/rlz/lib/
crc8_unittest.cc 19 // CRC-8, Polynomial 0x07, Initial value 0x00, Final XOR value 0x55
  /external/jsilver/src/com/google/clearsilver/jsilver/functions/string/
CrcFunction.java 38 // This function produces a 'standard' CRC-32 (IV -1, reflected polynomial,
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/tools/
user.hpp 29 // The maximum order of polynomial that will be evaluated
  /system/core/libsparse/
sparse_format.h 31 /* as 0. Standard 802.3 polynomial, use a Public Domain */
sparse_crc32.c 7 * First, the polynomial itself and its table of feedback terms. The
8 * polynomial is
39 * polynomial $edb88320
  /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/jni/
jni_stochastic_linear_ranker.h 53 /* Three differnt kernels are supported: Linear "LINEAR", Polynomial "POLY", and RBF "RBF"
57 /* Kernel param is kernel-specific. In case of polynomial kernel, it is the degree of the
58 polynomial. In case of RBF kernel, it implies the sigma parameter. In case of linear
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/util/
ECUtil.java 37 * Returns a sorted array of middle terms of the reduction polynomial.
38 * @param k The unsorted array of middle terms of the reduction polynomial
40 * @return the sorted array of middle terms of the reduction polynomial.
  /external/chromium_org/third_party/libjingle/source/talk/base/
crc32.cc 36 // CRC32 polynomial, in reversed form.
  /external/chromium_org/third_party/zlib/
crc32.c 83 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
88 is just exclusive-or, and multiplying a polynomial by x is a right shift by
89 one. If we call the above polynomial p, and represent a byte as the
90 polynomial q, also with the lowest power in the most significant bit (so the
91 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
112 unsigned long poly; /* polynomial exclusive-or pattern */
113 /* terms of polynomial defining this crc (except x^32): */
123 /* make exclusive-or pattern from polynomial (0xedb88320UL) */
387 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */
  /external/e2fsprogs/e2fsck/
crc32defs.h 3 * *the* standard CRC-32 polynomial, first popularized by Ethernet.
crc32.c 256 * CRC polynomial. To check the CRC, you can either check that the
268 * A 32-bit CRC polynomial is actually 33 bits long. But since it's
282 * the divisor (the CRC polynomial) you're dividing by. Each step of the
291 * the polynomial from the remainder and we're back to where we started,
358 * but again the multiple of the polynomial to subtract depends only on
363 * generator polynomial. This is simply the CRC-32 of the given
367 * is already a multiple of a polynomial produces a larger multiple of that
368 * polynomial. To enable a CRC to detect this condition, it's common to
  /external/qemu/distrib/zlib-1.2.3/
crc32.c 81 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
86 is just exclusive-or, and multiplying a polynomial by x is a right shift by
87 one. If we call the above polynomial p, and represent a byte as the
88 polynomial q, also with the lowest power in the most significant bit (so the
89 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
110 unsigned long poly; /* polynomial exclusive-or pattern */
111 /* terms of polynomial defining this crc (except x^32): */
121 /* make exclusive-or pattern from polynomial (0xedb88320UL) */
385 odd[0] = 0xedb88320L; /* CRC-32 polynomial */
  /external/zlib/src/
crc32.c 65 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
70 is just exclusive-or, and multiplying a polynomial by x is a right shift by
71 one. If we call the above polynomial p, and represent a byte as the
72 polynomial q, also with the lowest power in the most significant bit (so the
73 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
94 z_crc_t poly; /* polynomial exclusive-or pattern */
95 /* terms of polynomial defining this crc (except x^32): */
105 /* make exclusive-or pattern from polynomial (0xedb88320UL) */
370 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */
  /frameworks/base/core/java/android/view/
VelocityTracker.java 220 * An estimator for the movements of a pointer based on a polynomial model.
236 * Polynomial coefficients describing motion in X.
241 * Polynomial coefficients describing motion in Y.
246 * Polynomial degree, or zero if only position information is available.
  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_utilities_poly.cpp 101 /*Cubic polynomial roots, nr of roots and coefficients*/
173 /*Cubic polynomial roots, nr of roots and coefficients*/
  /packages/apps/Camera2/jni/feature_stab/db_vlvm/
db_utilities_poly.cpp 101 /*Cubic polynomial roots, nr of roots and coefficients*/
173 /*Cubic polynomial roots, nr of roots and coefficients*/
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.cpp 101 /*Cubic polynomial roots, nr of roots and coefficients*/
173 /*Cubic polynomial roots, nr of roots and coefficients*/

Completed in 1064 milliseconds

1 23 4 5 6 7 8 91011>>