| /external/eigen/test/ |
| stdlist.cpp | 79 typedef typename QuaternionType::Coefficients Coefficients;
80 QuaternionType x(Coefficients::Random()), y(Coefficients::Random());
|
| /external/fec/ |
| dotprod_av.c | 10 int len; /* Number of coefficients */
12 /* On an Altivec machine, these hold 8 copies of the coefficients,
29 /* Make 8 copies of coefficients, one for each data alignment,
64 * input buffer. Then set d to one of 8 sets of shifted coefficients
|
| init_rs.c | 26 * gfpoly = Field generator polynomial coefficients
|
| init_rs_char.c | 22 * gfpoly = Field generator polynomial coefficients
|
| init_rs_int.c | 22 * gfpoly = Field generator polynomial coefficients
|
| /external/flac/libFLAC/include/private/ |
| lpc.h | 99 * Computes LP coefficients for orders 1..max_order.
105 * OUT lp_coeff[0,max_order-1][0,max_order-1] LP coefficients for each order
113 * Example: if max_order is 9, the LP coefficients for order 9 will be
114 * in lp_coeff[8][0,8], the LP coefficients for order 8 will be
122 * Quantizes the LP coefficients. NOTE: precision + bits_per_sample
125 * IN lp_coeff[0,order-1] LP coefficients
130 * OUT qlp_coeff[0,order-1] quantized coefficients
132 * LP coefficients. NOTE: could be negative.
134 * 1 => coefficients require too much shifting for *shift to
136 * 2 => coefficients are all zero, which is bad. 'shift' i
[all...] |
| /external/libjpeg-turbo/simd/ |
| jfdctflt-sse-64.asm | 93 movaps xmm4,xmm0 ; transpose coefficients(phase 1)
96 movaps xmm5,xmm2 ; transpose coefficients(phase 1)
111 movaps xmm4,xmm6 ; transpose coefficients(phase 1)
114 movaps xmm2,xmm1 ; transpose coefficients(phase 1)
118 movaps xmm7,xmm6 ; transpose coefficients(phase 2)
121 movaps xmm3,xmm2 ; transpose coefficients(phase 2)
137 movaps xmm7,xmm4 ; transpose coefficients(phase 2)
140 movaps xmm6,xmm1 ; transpose coefficients(phase 2)
228 movaps xmm4,xmm0 ; transpose coefficients(phase 1)
231 movaps xmm5,xmm2 ; transpose coefficients(phase 1
[all...] |
| jfdctflt-sse.asm | 100 movaps xmm4,xmm0 ; transpose coefficients(phase 1)
103 movaps xmm5,xmm2 ; transpose coefficients(phase 1)
118 movaps xmm4,xmm6 ; transpose coefficients(phase 1)
121 movaps xmm2,xmm1 ; transpose coefficients(phase 1)
125 movaps xmm7,xmm6 ; transpose coefficients(phase 2)
128 movaps xmm3,xmm2 ; transpose coefficients(phase 2)
144 movaps xmm7,xmm4 ; transpose coefficients(phase 2)
147 movaps xmm6,xmm1 ; transpose coefficients(phase 2)
236 movaps xmm4,xmm0 ; transpose coefficients(phase 1)
239 movaps xmm5,xmm2 ; transpose coefficients(phase 1
[all...] |
| jfdctfst-mmx.asm | 115 movq mm4,mm0 ; transpose coefficients(phase 1)
118 movq mm5,mm2 ; transpose coefficients(phase 1)
133 movq mm4,mm6 ; transpose coefficients(phase 1)
136 movq mm2,mm1 ; transpose coefficients(phase 1)
140 movq mm7,mm6 ; transpose coefficients(phase 2)
143 movq mm3,mm2 ; transpose coefficients(phase 2)
159 movq mm7,mm4 ; transpose coefficients(phase 2)
162 movq mm6,mm1 ; transpose coefficients(phase 2)
256 movq mm4,mm0 ; transpose coefficients(phase 1)
259 movq mm5,mm2 ; transpose coefficients(phase 1
[all...] |
| /external/libopus/silk/ |
| LPC_fit.c | 34 /* Convert int32 coefficients to int16 coefs and make sure there's no wrap-around */
46 /* Limit the maximum absolute value of the prediction coefficients, so that they'll fit in int16 */
60 /* Reduce magnitude of prediction coefficients */
71 /* Reached the last iteration, clip the coefficients */
|
| process_NLSFs.c | 37 opus_int16 PredCoef_Q12[ 2 ][ MAX_LPC_ORDER ], /* O Prediction coefficients */
91 /* Convert quantized NLSFs back to LPC coefficients */
99 /* Convert back to LPC coefficients */
103 /* Copy LPC coefficients for first half from second half */
|
| /external/libvpx/libvpx/vp8/common/ |
| entropy.h | 58 /* Coefficients are predicted via a 3-dimensional probability table. */
71 the extent to which nearby coefficients are nonzero. For the first
74 then the number (0,1,or 2) of these blocks having nonzero coefficients.
77 Note that the intuitive meaning of this measure changes as coefficients
|
| /external/webrtc/webrtc/common_audio/ |
| fir_filter_neon.h | 22 FIRFilterNEON(const float* coefficients,
|
| fir_filter_sse.h | 22 FIRFilterSSE2(const float* coefficients,
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| cb_search.h | 31 int16_t *weightDenum,/* (i) weighting filter coefficients in Q12 */
|
| decoder_interpolate_lsf.c | 25 * obtain synthesis and weighting filters form lsf coefficients
29 int16_t *syntdenum, /* (o) synthesis filter coefficients */
31 coefficients */
32 int16_t *lsfdeq, /* (i) dequantized lsf coefficients */
|
| bw_expand.c | 27 int16_t *out, /* (o) the bandwidth expanded lpc coefficients */
28 int16_t *in, /* (i) the lpc coefficients before bandwidth
|
| bw_expand.h | 29 int16_t *out, /* (o) the bandwidth expanded lpc coefficients */
30 int16_t *in, /* (i) the lpc coefficients before bandwidth
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/ |
| lpc_shape_swb12_tables.c | 44 * A rotation matrix to remove correlation among LAR coefficients
63 * The smallest reconstruction points for quantiztion of LAR coefficients.
73 * Number of reconstruction points of quantizers for LAR coefficients.
93 * coefficients.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
| Relationship.java | 53 * Get the relationship obtained when multiplying all coefficients by -1.
54 * @return relationship obtained when multiplying all coefficients by -1
|
| /external/eigen/doc/ |
| TutorialAdvancedInitialization.dox | 13 Eigen offers a comma initializer syntax which allows the user to easily set all the coefficients of a matrix,
14 vector or array. Simply list the coefficients, starting at the top-left corner and moving from left to right
16 or too many coefficients, Eigen will complain.
67 used to initialize all coefficients to zero. There are three variants. The first variant takes no arguments
82 Similarly, the static method \link DenseBase::Constant() Constant\endlink(value) sets all coefficients to \c value.
85 \endlink fills the matrix or array with random coefficients. The identity matrix can be obtained by calling
89 one-dimensional arrays; it yields a vector of the specified size whose coefficients are equally spaced between
140 The expression <tt>m + MatrixXf::Constant(3,3,1.2)</tt> constructs the 3-by-3 matrix expression with all its coefficients
|
| TutorialReshapeSlicing.dox | 12 A reshape operation consists in modifying the sizes of a matrix while keeping the same coefficients.
25 Remark how the storage order of the input matrix modifies the order of the coefficients in the linear view.
|
| /external/libvpx/libvpx/vpx_dsp/ |
| vpx_dsp_common.h | 34 // tran_low_t is the datatype used for final transform coefficients.
40 // tran_low_t is the datatype used for final transform coefficients.
|
| /external/speex/libspeex/ |
| lpc.h | 4 @brief Functions for LPC (Linear Prediction Coefficients) analysis
47 spx_coef_t * lpc, /* [0...p-1] LPC coefficients */
|
| /external/webrtc/webrtc/common_audio/signal_processing/ |
| downsample_fast_neon.c | 21 const int16_t* __restrict coefficients,
50 int32x2_t coeff32 = vld1_dup_s32((int32_t*)&coefficients[j]);
72 int16x4_t coeff16x4 = vld1_dup_s16(&coefficients[j]);
91 int16x4_t coeff16x4 = vld1_dup_s16(&coefficients[j]);
118 int16x4_t coeff16x4 = vld1_s16(&coefficients[j]);
147 int16x4_t coeff16x4 = vld1_dup_s16(&coefficients[j]);
178 int16x4_t coeff16x4 = vld1_dup_s16(&coefficients[j]);
208 out_s32 = WebRtc_MulAccumW16(coefficients[j], data_in[i - j], out_s32);
|
