| /external/jpeg/ |
| armv6_idct.S | 20 * coefficients just like other methods.
24 * on page 52 of the JPEG textbook by Pennebaker and Mitchell. Coefficients
35 * general, we let r0 to r7 hold the coefficients; r10 and r11 hold four
46 * time. Rearranging coefficients also helps, but that requires to change a
48 * up quantization values by 13 bits, so the coefficients are scaled up by
91 // Load coefficients. (c[4, 1, 2, 3, 0, 5, 6, 7])
243 // Load coefficients. (c[0, 1, 2, 3, 4, 5, 6, 7])
|
| jdphuff.c | 124 * coefficients during early scans, leading to bizarre displays due to
265 * Huffman-compressed coefficients.
266 * The coefficients are reordered from zigzag order into natural array order,
274 * coefficients may already have been assigned. This is harmless for
321 /* Decode a single block's worth of coefficients */
525 * nonzero coefficients in the block, because otherwise we'd get confused
526 * next time about which coefficients were already nonzero.
527 * But we need not undo addition of bits to already-nonzero coefficients;
627 /* Re-zero any output coefficients that we made newly nonzero */
635 * Save the current Huffman deocde position and the DC coefficients
[all...] |
| jdtrans.c | 79 * to the coefficients during a full buffered-image-mode decompression.
145 * to the coefficients during a full buffered-image-mode decompression.
196 * to the coefficients during a full buffered-image-mode decompression.
|
| mips_jidctfst.c | 12 * must also perform dequantization of the input coefficients.
63 * The dequantized coefficients are not integers because the AA&N scaling
181 * Perform dequantization and inverse DCT on one block of coefficients.
|
| /external/pixman/test/ |
| stress-test.c | 248 pixman_fixed_t *coefficients = NULL; local
359 coefficients = malloc (n_coefficients * sizeof (pixman_fixed_t));
361 if (coefficients)
366 coefficients[i + 2] = prng_rand();
368 coefficients[0] = width << 16;
369 coefficients[1] = height << 16;
385 pixman_image_set_filter (image, filter, coefficients, n_coefficients);
|
| /external/qemu/distrib/jpeg-6b/ |
| armv6_idct.S | 20 * coefficients just like other methods.
24 * on page 52 of the JPEG textbook by Pennebaker and Mitchell. Coefficients
35 * general, we let r0 to r7 hold the coefficients; r10 and r11 hold four
46 * time. Rearranging coefficients also helps, but that requires to change a
48 * up quantization values by 13 bits, so the coefficients are scaled up by
91 // Load coefficients. (c[4, 1, 2, 3, 0, 5, 6, 7])
243 // Load coefficients. (c[0, 1, 2, 3, 4, 5, 6, 7])
|
| jdphuff.c | 128 * coefficients during early scans, leading to bizarre displays due to
269 * Huffman-compressed coefficients.
270 * The coefficients are reordered from zigzag order into natural array order,
278 * coefficients may already have been assigned. This is harmless for
325 /* Decode a single block's worth of coefficients */
529 * nonzero coefficients in the block, because otherwise we'd get confused
530 * next time about which coefficients were already nonzero.
531 * But we need not undo addition of bits to already-nonzero coefficients;
631 /* Re-zero any output coefficients that we made newly nonzero */
639 * Save the current Huffman deocde position and the DC coefficients
[all...] |
| jdtrans.c | 79 * to the coefficients during a full buffered-image-mode decompression.
145 * to the coefficients during a full buffered-image-mode decompression.
196 * to the coefficients during a full buffered-image-mode decompression.
|
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| a_refl.h | 49 Purpose : Convert from direct form coefficients to
50 reflection coefficients
103 * PURPOSE: Convert from direct form coefficients to reflection coefficients
106 * reflection coefficients Q15
109 Word16 a[], /* i : Directform coefficients */
110 Word16 refl[], /* o : Reflection coefficients */
|
| /external/aac/libAACenc/src/ |
| aacenc_tns.cpp | 793 /* non-linear quantization of TNS lattice coefficients with given resolution */
832 /* non-linear quantization of TNS lattice coefficients with given resolution */
[all...] |
| /external/eigen/doc/ |
| I03_InsideEigenExample.dox | 60 However, in the above program, we have chosen size=50, so our vectors consist of 50 float's, and 50 is not a multiple of 4. This means that we cannot hope to do all of that computation using SSE2 instructions. The second best thing, to which we should aim, is to handle the 48 first coefficients with SSE2 instructions, since 48 is the biggest multiple of 4 below 50, and then handle separately, without SSE2, the 49th and 50th coefficients. Something like this:
92 You may wonder, isn't it overengineering to have the storage in a separate class? The reason is that the Matrix class template covers all kinds of matrices and vector: both fixed-size and dynamic-size. The storage method is not the same in these two cases. For fixed-size, the matrix coefficients are stored as a plain member array. For dynamic-size, the coefficients will be stored as a pointer to a dynamically-allocated array. Because of this, we need to abstract storage away from the Matrix class. That's DenseStorage.
107 Here, the \a m_data member is the actual array of coefficients of the matrix. As you see, it is dynamically allocated. Rather than calling new[] or malloc(), as you can see, we have our own internal::aligned_new defined in src/Core/util/Memory.h. What it does is that if vectorization is enabled, then it uses a platform-specific call to allocate a 128-bit-aligned array, as that is very useful for vectorization with both SSE2 and AltiVec. If vectorization is disabled, it amounts to the standard new[].
111 When you call VectorXf::data() to get the pointer to the array of coefficients, it returns DenseStorage::data() which returns the \a m_data member.
163 This means that we can put almost all the methods and operators in the base class MatrixBase, and have only the bare minimum in the subclasses. If you look at the subclasses in Eigen, like for instance the CwiseBinaryOp class, they have very few methods. There are coeff() and sometimes coeffRef() methods for access to the coefficients, there are rows() and cols() methods returning the number of rows and columns, but there isn't much more than that. All the meat is in MatrixBase, so it only needs to be coded once for all kinds of expressions, matrices, and vectors.
189 As we said, CwiseBinaryOp is also used for other operations such as substration, so it takes another template parameter determining the operation that will be applied to coefficients. This template parameter is a functor, that is, a class in which we have an operator() so it behaves like a function. Here, the functor used is internal::scalar_sum_op. It is defined in src/Core/Functors.h.
363 Here's how it works. \a LinearVectorization means that the left-hand and right-hand side expression can be accessed linearly i.e. you can refer to their coefficients by one integer \a index, as opposed to having to refer to its coefficients by two integers \a row, \a column
[all...] |
| I12_ClassHierarchy.dox | 56 array of coefficients. This is where, for instance, the \link PlainObjectBase::resize() resize() \endlink
66 \c x.transpose() and \c x.block(...) also have direct access, because their coefficients can be read right
68 coefficients requires a computation (an addition), it can't be just read off memory.
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
| entropy_coding.c | 216 /* Dither on half of the coefficients. */
370 /* The second half of real and imaginary coefficients is zero. This is
508 /* Find AR coefficients */
523 /* Find RC coefficients. */
529 /* RC -> AR coefficients */
759 /* calculate the step-size for linear interpolation coefficients */
889 /* find quantization levels for coefficients */
986 /* Low-band LAR coefficients. */
992 /* High-band LAR coefficients. */
1019 /* Low-band LAR coefficients. *
[all...] |
| decode.c | 111 /* Decode & de-quantize filter coefficients. */
199 /* Decode & de-quantize filter coefficients. */
265 /* Decode & dequantize filter coefficients. */
|
| /frameworks/av/media/libeffects/lvm/lib/Bass/src/ |
| LVDBE_Coeffs.h | 33 /* High Pass Filter coefficients */
37 /* Coefficients for centre frequency 55Hz */
84 /* Coefficients for centre frequency 66Hz */
131 /* Coefficients for centre frequency 78Hz */
178 /* Coefficients for centre frequency 90Hz */
228 /* Band Pass Filter coefficients */
232 /* Coefficients for centre frequency 55Hz */
279 /* Coefficients for centre frequency 66Hz */
326 /* Coefficients for centre frequency 78Hz */
[all...] |
| /frameworks/av/media/libstagefright/codecs/aacenc/src/ |
| tns.c | 631 * output: reflection coefficients
709 * description: conversion autocorrelation to reflection coefficients
713 * output: <order> reflection coefficients
806 * description: quantization index for reflection coefficients
809 static void Parcor2Index(const Word32 parcor[], /*!< parcor coefficients */
830 * description: Inverse quantization for reflection coefficients
834 Word32 parcor[], /*!< ptr. to reflection coefficients (output) */
835 Word16 order, /*!< no. of coefficients */
862 const Word32 *coef_par) /*!< filter coefficients */
897 const Word32 parCoeff[],/*!< PARC coefficients */
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Redux.h | 333 /** \returns the minimum of all coefficients of *this
342 /** \returns the maximum of all coefficients of *this
351 /** \returns the sum of all coefficients of *this
364 /** \returns the mean of all coefficients of *this
375 /** \returns the product of all coefficients of *this
391 /** \returns the trace of \c *this, i.e. the sum of the coefficients on the main diagonal.
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| HessenbergDecomposition.h | 76 /** \brief Type for vector of Householder coefficients.
164 /** \brief Returns the Householder coefficients.
166 * \returns a const reference to the vector of Householder coefficients
172 * The Householder coefficients allow the reconstruction of the matrix
195 * Householder coefficients returned by householderCoefficients(),
283 * \param hCoeffs returned Householder coefficients
|
| /external/opencv/cvaux/src/ |
| cvhmmobs.cpp | 175 /* do transfroms for each column. Calc only first obsSize.height DCT coefficients */
205 /* other coefficients */
273 /* other coefficients */
372 /* do transfroms for each column. Calc only first obsSize.height DCT coefficients */
402 /* other coefficients */
470 /* other coefficients */
|
| /external/chromium_org/skia/ext/ |
| convolver.h | 127 // Padding |padding_count| of more dummy coefficients after the coefficients
130 // coefficients right now due to the opaqueness of <vector> implementation.
|
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| main_FIX.h | 102 /* Compute noise shaping coefficients and initial gain values */
138 /* Find LPC and LTP coefficients */
172 const opus_int16 LTPCoef_Q14[ LTP_ORDER * MAX_NB_SUBFR ],/* I LTP_ORDER LTP coefficients for each MAX_NB_SUBFR subframe */
|
| /external/webrtc/src/common_audio/signal_processing/ |
| levinson_durbin.c | 26 // Auto-correlation coefficients in high precision
28 // LPC coefficients in high precision
30 // LPC coefficients for next iteration
|
| splitting_filter.c | 24 // QMF filter coefficients in Q16.
36 // - filter_coefficients : Filter coefficients (length 3, Q16)
57 // The input vector |filter_coefficients| includes these three filter coefficients.
|
| /external/webrtc/src/common_audio/vad/ |
| vad_filterbank.c | 25 // Coefficients used by WebRtcVad_HpOutput, Q14
29 // Allpass filter coefficients, upper and lower, in Q15
55 // all-zero section (filter coefficients in Q14)
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
| spectrum_ar_model_tables.c | 14 * This file contains tables with AR coefficients, Gain coefficients
90 /* quantization boundary levels for reflection coefficients */
|
