HomeSort by relevance Sort by last modified time
    Searched full:mult2q (Results 1 - 4 of 4) sorted by null

  /external/libopus/silk/
LPC_inv_pred_gain.c 47 opus_int k, n, mult2Q;
75 mult2Q = 32 - silk_CLZ32( silk_abs( rc_mult1_Q30 ) );
76 rc_mult2 = silk_INVERSE32_varQ( rc_mult1_Q30, mult2Q + 30 );
84 MUL32_FRAC_Q( tmp2, rc_Q31, 31 ) ), rc_mult2 ), mult2Q);
90 MUL32_FRAC_Q( tmp1, rc_Q31, 31 ) ), rc_mult2), mult2Q);
  /external/libopus/silk/arm/
LPC_inv_pred_gain_neon_intr.c 45 * Here we know that mult2Q >= 1, so the highest bit (bit 63, sign bit) of tmp64 must equal to bit 62.
60 opus_int k, n, mult2Q;
96 mult2Q = 32 - silk_CLZ32( silk_abs( rc_mult1_Q30 ) );
97 rc_mult2 = silk_INVERSE32_varQ( rc_mult1_Q30, mult2Q + 30 );
101 mult2Q_s64x2 = vdupq_n_s64( -mult2Q );
142 MUL32_FRAC_Q( tmp2, rc_Q31, 31 ) ), rc_mult2 ), mult2Q);
148 MUL32_FRAC_Q( tmp1, rc_Q31, 31 ) ), rc_mult2), mult2Q);
  /external/libopus/doc/
opus_update.patch 60 - Anew_QA[ n ] = MUL32_FRAC_Q( tmp_QA, rc_mult2 , mult2Q );
63 + tmp64 = silk_RSHIFT_ROUND64( silk_SMULL( tmp_QA, rc_mult2 ), mult2Q);
draft-ietf-codec-opus-update.xml 247 - Anew_QA[ n ] = MUL32_FRAC_Q( tmp_QA, rc_mult2 , mult2Q );
252 rc_mult2 ), mult2Q);

Completed in 85 milliseconds