HomeSort by relevance Sort by last modified time
    Searched full:coefficient (Results 126 - 150 of 717) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/skia/include/effects/
SkBlurMaskFilter.h 48 @param specular coefficient for specular highlights (e.g. 8)
  /external/webrtc/src/common_audio/signal_processing/
levinson_durbin.c 32 // Reflection coefficient in high precision
70 // Store first reflection coefficient
162 // Store Reflection coefficient in Q15
174 Compute updated LPC coefficient: Anew[i]
  /frameworks/av/media/libeffects/lvm/lib/Common/src/
DelayAllPass_Sat_32x16To32.c 32 LVM_INT16 coeff, /* All pass filter coefficient */
  /frameworks/av/media/libeffects/testlibs/
AudioBiquadFilter.h 31 // A mechanism for suppression of artifacts caused by abrupt coefficient changes
100 // The maximum rate of coefficient change, measured in coefficient units per
126 // Maximum coefficient delta per sample.
AudioPeakingFilter.h 35 // using a linear interpolation from a coefficient table, using a
38 // fractional indices into the coefficient table.
144 // A coefficient interpolator, used for mapping the high level parameters to
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/
armVCM4P2_SetPredDir_s.s 27 ; * [in] pCoefBufRow pointer to the coefficient row buffer
omxVCM4P2_DecodeVLCZigzag_IntraDCVLC_s.s 39 ; * [out] pDst pointer to the coefficient buffer of current
134 ;// Decode DC Coefficient
184 ;// Decode AC Coefficient
omxVCM4P2_QuantInvIntra_I_s.s 95 ;// Perform Inverse Quantization for DC coefficient
110 SMULBB temp,temp,dcScaler ;// dcCoeff = dcScaler * Quantized DC coefficient(from memory)
174 ;// Storing the Inverse Quantized DC coefficient
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/
armVCM4P2_SetPredDir_s.s 27 ; * [in] pCoefBufRow pointer to the coefficient row buffer
omxVCM4P2_DecodeVLCZigzag_IntraDCVLC_s.s 39 ; * [out] pDst pointer to the coefficient buffer of current
134 ;// Decode DC Coefficient
184 ;// Decode AC Coefficient
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p2/src/
omxVCM4P2_IDCT8x8blk.c 37 * [ISO14496-2], the input coefficient values should lie within the
  /libcore/luni/src/test/java/tests/security/interfaces/
RSAPrivateCrtKeyTest.java 38 assertEquals("invalid CRT coefficient",
  /external/chromium_org/third_party/WebKit/Source/core/platform/
Decimal.h 63 EncodedData(Sign, int exponent, uint64_t coefficient);
68 uint64_t coefficient() const { return m_coefficient; } function in class:WebCore::Decimal::EncodedData
97 Decimal(Sign, int exponent, uint64_t coefficient);
  /external/eigen/Eigen/src/Core/
Select.h 18 * \brief Expression of a coefficient wise version of the C++ ternary operator ?:
24 * This class represents an expression of a coefficient wise version of the C++ ternary operator ?:.
113 /** \returns a matrix where each coefficient (i,j) is equal to \a thenMatrix(i,j)
  /external/eigen/Eigen/src/SparseCore/
MappedSparseMatrix.h 77 // ^^ optimization: let's first check if it is the last coefficient
93 eigen_assert(end>start && "coeffRef cannot be called on a zero coefficient");
96 eigen_assert((*r==inner) && (id<end) && "coeffRef cannot be called on a zero coefficient");
  /external/jpeg/
jutils.c 47 * "63"s after the real entries. This will cause the extra coefficient
97 * and coefficient-block arrays. This won't work on 80x86 because the arrays
153 /* Copy a row of coefficient blocks from one place to another. */
jdphuff.c 323 /* Section F.2.2.1: decode the DC coefficient difference */
334 /* Scale and output the coefficient (assumes jpeg_natural_order[0]=0) */
402 /* Scale and output coefficient in natural (dezigzagged) order */
532 /* initialize coefficient loop counter to start of band */
562 * if the absolute value of the coefficient must be increased.
578 break; /* reached target zero coefficient */
584 /* Output newly nonzero coefficient */
593 /* Scan any remaining coefficient positions after the end-of-band
594 * (the last newly nonzero coefficient, if any). Append a correction
595 * bit to each already-nonzero coefficient. A correction bit is
    [all...]
jccoefct.c 8 * This file contains the coefficient buffer controller for compression.
10 * The coefficient buffer lies between forward-DCT and entropy encoding steps.
18 /* We use a full-image coefficient buffer when doing Huffman optimization,
44 * workspace of C_MAX_BLOCKS_IN_MCU coefficient blocks, and reuse it for each
47 * when a large coefficient buffer is necessary.)
401 * Initialize coefficient buffer controller.
415 /* Create the coefficient buffer. */
jctrans.c 9 * that is, writing raw DCT coefficient arrays to an output JPEG file.
26 * Compression initialization for writing raw-coefficient data.
182 /* We need a special coefficient buffer controller. */
199 * The rest of this file is a special implementation of the coefficient
355 * Initialize coefficient buffer controller.
357 * Each passed coefficient array must be the right size for that
358 * coefficient: width_in_blocks wide and height_in_blocks high,
  /external/qemu/distrib/jpeg-6b/
jutils.c 47 * "63"s after the real entries. This will cause the extra coefficient
97 * and coefficient-block arrays. This won't work on 80x86 because the arrays
153 /* Copy a row of coefficient blocks from one place to another. */
jdphuff.c 327 /* Section F.2.2.1: decode the DC coefficient difference */
338 /* Scale and output the coefficient (assumes jpeg_natural_order[0]=0) */
406 /* Scale and output coefficient in natural (dezigzagged) order */
536 /* initialize coefficient loop counter to start of band */
566 * if the absolute value of the coefficient must be increased.
582 break; /* reached target zero coefficient */
588 /* Output newly nonzero coefficient */
597 /* Scan any remaining coefficient positions after the end-of-band
598 * (the last newly nonzero coefficient, if any). Append a correction
599 * bit to each already-nonzero coefficient. A correction bit is
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrnb/common/include/
cnst_vad.h 106 #define COEFF3 13363 /* coefficient for the 3rd order filter */
107 #define COEFF5_1 21955 /* 1st coefficient the for 5th order filter */
108 #define COEFF5_2 6390 /* 2nd coefficient the for 5th order filter */
  /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
wb_vad_c.h 100 #define COEFF3 13363 /* coefficient for the 3rd order filter */
101 #define COEFF5_1 21955 /* 1st coefficient the for 5th order filter */
102 #define COEFF5_2 6390 /* 2nd coefficient the for 5th order filter */
  /external/eigen/doc/
A05_PortingFrom2To3.dox 94 \section CoefficientWiseOperations Coefficient wise operations
96 In Eigen2, coefficient wise operations which have no proper mathematical definition (as a coefficient wise product)
100 Array for which all operations are performed coefficient wise. You can easily view a matrix as an array and vice versa using
108 a permanent conversion to the array world. Therefore, for binary operations such as the coefficient wise product,
110 concatenate multiple coefficient wise operations you only have to do the conversion once, e.g.:
276 it might be useful to explicit request for a lay product, i.e., for a product which will be evaluated one coefficient at once, on request,
C07_TutorialReductionsVisitorsBroadcasting.dox 69 These are typically used in conjunction with the coefficient-wise comparison and equality operators provided by Array. For instance, <tt>array > 0</tt> is an %Array of the same size as \c array , with \b true at those positions where the corresponding coefficient of \c array is positive. Thus, <tt>(array > 0).all()</tt> tests whether all coefficients of \c array are positive. This can be seen in the following example:
87 Visitors are useful when one wants to obtain the location of a coefficient inside
91 the location of the greatest or smallest coefficient in a Matrix or
107 Note that both functions also return the value of the minimum or maximum coefficient if needed,
203 can also use the operators <tt>*=</tt>, <tt>/=</tt>, <tt>*</tt> and <tt>/</tt> to perform coefficient-wise
259 this operation is a row-vector where each coefficient is the squared Euclidean distance between each column in <tt>m</tt> and <tt>v</tt>: \f[

Completed in 797 milliseconds

1 2 3 4 56 7 8 91011>>