| OLD | NEW |
| 1 /*********************************************************************** | 1 /*********************************************************************** |
| 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. | 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| 3 Redistribution and use in source and binary forms, with or without | 3 Redistribution and use in source and binary forms, with or without |
| 4 modification, are permitted provided that the following conditions | 4 modification, are permitted provided that the following conditions |
| 5 are met: | 5 are met: |
| 6 - Redistributions of source code must retain the above copyright notice, | 6 - Redistributions of source code must retain the above copyright notice, |
| 7 this list of conditions and the following disclaimer. | 7 this list of conditions and the following disclaimer. |
| 8 - Redistributions in binary form must reproduce the above copyright | 8 - Redistributions in binary form must reproduce the above copyright |
| 9 notice, this list of conditions and the following disclaimer in the | 9 notice, this list of conditions and the following disclaimer in the |
| 10 documentation and/or other materials provided with the distribution. | 10 documentation and/or other materials provided with the distribution. |
| (...skipping 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 59 out[n] += out[n-2] - (opus_int32)silk_RSHIFT_ROUND64( silk_SMULL( ft
mp, out[n-1] ), QA ); | 59 out[n] += out[n-2] - (opus_int32)silk_RSHIFT_ROUND64( silk_SMULL( ft
mp, out[n-1] ), QA ); |
| 60 } | 60 } |
| 61 out[1] -= ftmp; | 61 out[1] -= ftmp; |
| 62 } | 62 } |
| 63 } | 63 } |
| 64 | 64 |
| 65 /* compute whitening filter coefficients from normalized line spectral frequenci
es */ | 65 /* compute whitening filter coefficients from normalized line spectral frequenci
es */ |
| 66 void silk_NLSF2A( | 66 void silk_NLSF2A( |
| 67 opus_int16 *a_Q12, /* O monic whitening filt
er coefficients in Q12, [ d ] */ | 67 opus_int16 *a_Q12, /* O monic whitening filt
er coefficients in Q12, [ d ] */ |
| 68 const opus_int16 *NLSF, /* I normalized line spec
tral frequencies in Q15, [ d ] */ | 68 const opus_int16 *NLSF, /* I normalized line spec
tral frequencies in Q15, [ d ] */ |
| 69 const opus_int d /* I filter order (should
be even) */ | 69 const opus_int d, /* I filter order (should
be even) */ |
| 70 int arch /* I Run-time architectur
e */ |
| 70 ) | 71 ) |
| 71 { | 72 { |
| 72 /* This ordering was found to maximize quality. It improves numerical accura
cy of | 73 /* This ordering was found to maximize quality. It improves numerical accura
cy of |
| 73 silk_NLSF2A_find_poly() compared to "standard" ordering. */ | 74 silk_NLSF2A_find_poly() compared to "standard" ordering. */ |
| 74 static const unsigned char ordering16[16] = { | 75 static const unsigned char ordering16[16] = { |
| 75 0, 15, 8, 7, 4, 11, 12, 3, 2, 13, 10, 5, 6, 9, 14, 1 | 76 0, 15, 8, 7, 4, 11, 12, 3, 2, 13, 10, 5, 6, 9, 14, 1 |
| 76 }; | 77 }; |
| 77 static const unsigned char ordering10[10] = { | 78 static const unsigned char ordering10[10] = { |
| 78 0, 9, 6, 3, 4, 5, 8, 1, 2, 7 | 79 0, 9, 6, 3, 4, 5, 8, 1, 2, 7 |
| 79 }; | 80 }; |
| 80 const unsigned char *ordering; | 81 const unsigned char *ordering; |
| 81 opus_int k, i, dd; | 82 opus_int k, i, dd; |
| 82 opus_int32 cos_LSF_QA[ SILK_MAX_ORDER_LPC ]; | 83 opus_int32 cos_LSF_QA[ SILK_MAX_ORDER_LPC ]; |
| 83 opus_int32 P[ SILK_MAX_ORDER_LPC / 2 + 1 ], Q[ SILK_MAX_ORDER_LPC / 2 + 1 ]; | 84 opus_int32 P[ SILK_MAX_ORDER_LPC / 2 + 1 ], Q[ SILK_MAX_ORDER_LPC / 2 + 1 ]; |
| 84 opus_int32 Ptmp, Qtmp, f_int, f_frac, cos_val, delta; | 85 opus_int32 Ptmp, Qtmp, f_int, f_frac, cos_val, delta; |
| 85 opus_int32 a32_QA1[ SILK_MAX_ORDER_LPC ]; | 86 opus_int32 a32_QA1[ SILK_MAX_ORDER_LPC ]; |
| 86 opus_int32 maxabs, absval, idx=0, sc_Q16; | |
| 87 | 87 |
| 88 silk_assert( LSF_COS_TAB_SZ_FIX == 128 ); | 88 silk_assert( LSF_COS_TAB_SZ_FIX == 128 ); |
| 89 silk_assert( d==10||d==16 ); | 89 silk_assert( d==10 || d==16 ); |
| 90 | 90 |
| 91 /* convert LSFs to 2*cos(LSF), using piecewise linear curve from table */ | 91 /* convert LSFs to 2*cos(LSF), using piecewise linear curve from table */ |
| 92 ordering = d == 16 ? ordering16 : ordering10; | 92 ordering = d == 16 ? ordering16 : ordering10; |
| 93 for( k = 0; k < d; k++ ) { | 93 for( k = 0; k < d; k++ ) { |
| 94 silk_assert(NLSF[k] >= 0 ); | 94 silk_assert( NLSF[k] >= 0 ); |
| 95 | 95 |
| 96 /* f_int on a scale 0-127 (rounded down) */ | 96 /* f_int on a scale 0-127 (rounded down) */ |
| 97 f_int = silk_RSHIFT( NLSF[k], 15 - 7 ); | 97 f_int = silk_RSHIFT( NLSF[k], 15 - 7 ); |
| 98 | 98 |
| 99 /* f_frac, range: 0..255 */ | 99 /* f_frac, range: 0..255 */ |
| 100 f_frac = NLSF[k] - silk_LSHIFT( f_int, 15 - 7 ); | 100 f_frac = NLSF[k] - silk_LSHIFT( f_int, 15 - 7 ); |
| 101 | 101 |
| 102 silk_assert(f_int >= 0); | 102 silk_assert(f_int >= 0); |
| 103 silk_assert(f_int < LSF_COS_TAB_SZ_FIX ); | 103 silk_assert(f_int < LSF_COS_TAB_SZ_FIX ); |
| 104 | 104 |
| (...skipping 14 matching lines...) Expand all Loading... |
| 119 /* convert even and odd polynomials to opus_int32 Q12 filter coefs */ | 119 /* convert even and odd polynomials to opus_int32 Q12 filter coefs */ |
| 120 for( k = 0; k < dd; k++ ) { | 120 for( k = 0; k < dd; k++ ) { |
| 121 Ptmp = P[ k+1 ] + P[ k ]; | 121 Ptmp = P[ k+1 ] + P[ k ]; |
| 122 Qtmp = Q[ k+1 ] - Q[ k ]; | 122 Qtmp = Q[ k+1 ] - Q[ k ]; |
| 123 | 123 |
| 124 /* the Ptmp and Qtmp values at this stage need to fit in int32 */ | 124 /* the Ptmp and Qtmp values at this stage need to fit in int32 */ |
| 125 a32_QA1[ k ] = -Qtmp - Ptmp; /* QA+1 */ | 125 a32_QA1[ k ] = -Qtmp - Ptmp; /* QA+1 */ |
| 126 a32_QA1[ d-k-1 ] = Qtmp - Ptmp; /* QA+1 */ | 126 a32_QA1[ d-k-1 ] = Qtmp - Ptmp; /* QA+1 */ |
| 127 } | 127 } |
| 128 | 128 |
| 129 /* Limit the maximum absolute value of the prediction coefficients, so that
they'll fit in int16 */ | 129 /* Convert int32 coefficients to Q12 int16 coefs */ |
| 130 for( i = 0; i < 10; i++ ) { | 130 silk_LPC_fit( a_Q12, a32_QA1, 12, QA + 1, d ); |
| 131 /* Find maximum absolute value and its index */ | 131 |
| 132 maxabs = 0; | 132 for( i = 0; silk_LPC_inverse_pred_gain( a_Q12, d, arch ) == 0 && i < MAX_LPC
_STABILIZE_ITERATIONS; i++ ) { |
| 133 /* Prediction coefficients are (too close to) unstable; apply bandwidth
expansion */ |
| 134 /* on the unscaled coefficients, convert to Q12 and measure again
*/ |
| 135 silk_bwexpander_32( a32_QA1, d, 65536 - silk_LSHIFT( 2, i ) ); |
| 133 for( k = 0; k < d; k++ ) { | 136 for( k = 0; k < d; k++ ) { |
| 134 absval = silk_abs( a32_QA1[k] ); | 137 a_Q12[ k ] = (opus_int16)silk_RSHIFT_ROUND( a32_QA1[ k ], QA + 1 - 1
2 ); /* QA+1 -> Q12 */ |
| 135 if( absval > maxabs ) { | |
| 136 maxabs = absval; | |
| 137 idx = k; | |
| 138 } | |
| 139 } | |
| 140 maxabs = silk_RSHIFT_ROUND( maxabs, QA + 1 - 12 );
/* QA+1 -> Q12 */ | |
| 141 | |
| 142 if( maxabs > silk_int16_MAX ) { | |
| 143 /* Reduce magnitude of prediction coefficients */ | |
| 144 maxabs = silk_min( maxabs, 163838 ); /* ( silk_int32_MAX >> 14 ) +
silk_int16_MAX = 163838 */ | |
| 145 sc_Q16 = SILK_FIX_CONST( 0.999, 16 ) - silk_DIV32( silk_LSHIFT( maxa
bs - silk_int16_MAX, 14 ), | |
| 146 silk_RSHIFT32( silk_MUL( maxabs, idx + 1
), 2 ) ); | |
| 147 silk_bwexpander_32( a32_QA1, d, sc_Q16 ); | |
| 148 } else { | |
| 149 break; | |
| 150 } | |
| 151 } | |
| 152 | |
| 153 if( i == 10 ) { | |
| 154 /* Reached the last iteration, clip the coefficients */ | |
| 155 for( k = 0; k < d; k++ ) { | |
| 156 a_Q12[ k ] = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( a32_QA1[ k ]
, QA + 1 - 12 ) ); /* QA+1 -> Q12 */ | |
| 157 a32_QA1[ k ] = silk_LSHIFT( (opus_int32)a_Q12[ k ], QA + 1 - 12 ); | |
| 158 } | |
| 159 } else { | |
| 160 for( k = 0; k < d; k++ ) { | |
| 161 a_Q12[ k ] = (opus_int16)silk_RSHIFT_ROUND( a32_QA1[ k ], QA + 1 - 1
2 ); /* QA+1 -> Q12 */ | |
| 162 } | |
| 163 } | |
| 164 | |
| 165 for( i = 0; i < MAX_LPC_STABILIZE_ITERATIONS; i++ ) { | |
| 166 if( silk_LPC_inverse_pred_gain( a_Q12, d ) < SILK_FIX_CONST( 1.0 / MAX_P
REDICTION_POWER_GAIN, 30 ) ) { | |
| 167 /* Prediction coefficients are (too close to) unstable; apply bandwi
dth expansion */ | |
| 168 /* on the unscaled coefficients, convert to Q12 and measure again
*/ | |
| 169 silk_bwexpander_32( a32_QA1, d, 65536 - silk_LSHIFT( 2, i ) ); | |
| 170 for( k = 0; k < d; k++ ) { | |
| 171 a_Q12[ k ] = (opus_int16)silk_RSHIFT_ROUND( a32_QA1[ k ], QA + 1
- 12 ); /* QA+1 -> Q12 */ | |
| 172 } | |
| 173 } else { | |
| 174 break; | |
| 175 } | 138 } |
| 176 } | 139 } |
| 177 } | 140 } |
| 178 | 141 |
| OLD | NEW |