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 17 matching lines...) Expand all Loading... |
28 #ifdef HAVE_CONFIG_H | 28 #ifdef HAVE_CONFIG_H |
29 #include "config.h" | 29 #include "config.h" |
30 #endif | 30 #endif |
31 | 31 |
32 #include "main.h" | 32 #include "main.h" |
33 | 33 |
34 /* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for
a single input data vector */ | 34 /* Entropy constrained matrix-weighted VQ, hard-coded to 5-element vectors, for
a single input data vector */ |
35 void silk_VQ_WMat_EC( | 35 void silk_VQ_WMat_EC( |
36 opus_int8 *ind, /* O index of
best codebook vector */ | 36 opus_int8 *ind, /* O index of
best codebook vector */ |
37 opus_int32 *rate_dist_Q14, /* O best wei
ghted quant error + mu * rate */ | 37 opus_int32 *rate_dist_Q14, /* O best wei
ghted quant error + mu * rate */ |
| 38 opus_int *gain_Q7, /* O sum of a
bsolute LTP coefficients */ |
38 const opus_int16 *in_Q14, /* I input ve
ctor to be quantized */ | 39 const opus_int16 *in_Q14, /* I input ve
ctor to be quantized */ |
39 const opus_int32 *W_Q18, /* I weightin
g matrix */ | 40 const opus_int32 *W_Q18, /* I weightin
g matrix */ |
40 const opus_int8 *cb_Q7, /* I codebook
*/ | 41 const opus_int8 *cb_Q7, /* I codebook
*/ |
| 42 const opus_uint8 *cb_gain_Q7, /* I codebook
effective gain */ |
41 const opus_uint8 *cl_Q5, /* I code len
gth for each codebook vector */ | 43 const opus_uint8 *cl_Q5, /* I code len
gth for each codebook vector */ |
42 const opus_int mu_Q9, /* I tradeoff
betw. weighted error and rate */ | 44 const opus_int mu_Q9, /* I tradeoff
betw. weighted error and rate */ |
| 45 const opus_int32 max_gain_Q7, /* I maximum
sum of absolute LTP coefficients */ |
43 opus_int L /* I number o
f vectors in codebook */ | 46 opus_int L /* I number o
f vectors in codebook */ |
44 ) | 47 ) |
45 { | 48 { |
46 opus_int k; | 49 opus_int k, gain_tmp_Q7; |
47 const opus_int8 *cb_row_Q7; | 50 const opus_int8 *cb_row_Q7; |
48 opus_int16 diff_Q14[ 5 ]; | 51 opus_int16 diff_Q14[ 5 ]; |
49 opus_int32 sum1_Q14, sum2_Q16; | 52 opus_int32 sum1_Q14, sum2_Q16; |
50 | 53 |
51 /* Loop over codebook */ | 54 /* Loop over codebook */ |
52 *rate_dist_Q14 = silk_int32_MAX; | 55 *rate_dist_Q14 = silk_int32_MAX; |
53 cb_row_Q7 = cb_Q7; | 56 cb_row_Q7 = cb_Q7; |
54 for( k = 0; k < L; k++ ) { | 57 for( k = 0; k < L; k++ ) { |
| 58 gain_tmp_Q7 = cb_gain_Q7[k]; |
| 59 |
55 diff_Q14[ 0 ] = in_Q14[ 0 ] - silk_LSHIFT( cb_row_Q7[ 0 ], 7 ); | 60 diff_Q14[ 0 ] = in_Q14[ 0 ] - silk_LSHIFT( cb_row_Q7[ 0 ], 7 ); |
56 diff_Q14[ 1 ] = in_Q14[ 1 ] - silk_LSHIFT( cb_row_Q7[ 1 ], 7 ); | 61 diff_Q14[ 1 ] = in_Q14[ 1 ] - silk_LSHIFT( cb_row_Q7[ 1 ], 7 ); |
57 diff_Q14[ 2 ] = in_Q14[ 2 ] - silk_LSHIFT( cb_row_Q7[ 2 ], 7 ); | 62 diff_Q14[ 2 ] = in_Q14[ 2 ] - silk_LSHIFT( cb_row_Q7[ 2 ], 7 ); |
58 diff_Q14[ 3 ] = in_Q14[ 3 ] - silk_LSHIFT( cb_row_Q7[ 3 ], 7 ); | 63 diff_Q14[ 3 ] = in_Q14[ 3 ] - silk_LSHIFT( cb_row_Q7[ 3 ], 7 ); |
59 diff_Q14[ 4 ] = in_Q14[ 4 ] - silk_LSHIFT( cb_row_Q7[ 4 ], 7 ); | 64 diff_Q14[ 4 ] = in_Q14[ 4 ] - silk_LSHIFT( cb_row_Q7[ 4 ], 7 ); |
60 | 65 |
61 /* Weighted rate */ | 66 /* Weighted rate */ |
62 sum1_Q14 = silk_SMULBB( mu_Q9, cl_Q5[ k ] ); | 67 sum1_Q14 = silk_SMULBB( mu_Q9, cl_Q5[ k ] ); |
63 | 68 |
| 69 /* Penalty for too large gain */ |
| 70 sum1_Q14 = silk_ADD_LSHIFT32( sum1_Q14, silk_max( silk_SUB32( ga
in_tmp_Q7, max_gain_Q7 ), 0 ), 10 ); |
| 71 |
64 silk_assert( sum1_Q14 >= 0 ); | 72 silk_assert( sum1_Q14 >= 0 ); |
65 | 73 |
66 /* first row of W_Q18 */ | 74 /* first row of W_Q18 */ |
67 sum2_Q16 = silk_SMULWB( W_Q18[ 1 ], diff_Q14[ 1 ] ); | 75 sum2_Q16 = silk_SMULWB( W_Q18[ 1 ], diff_Q14[ 1 ] ); |
68 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 2 ], diff_Q14[ 2 ] ); | 76 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 2 ], diff_Q14[ 2 ] ); |
69 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 3 ], diff_Q14[ 3 ] ); | 77 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 3 ], diff_Q14[ 3 ] ); |
70 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 4 ], diff_Q14[ 4 ] ); | 78 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 4 ], diff_Q14[ 4 ] ); |
71 sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); | 79 sum2_Q16 = silk_LSHIFT( sum2_Q16, 1 ); |
72 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 0 ], diff_Q14[ 0 ] ); | 80 sum2_Q16 = silk_SMLAWB( sum2_Q16, W_Q18[ 0 ], diff_Q14[ 0 ] ); |
73 sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 0 ] ); | 81 sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 0 ] ); |
(...skipping 22 matching lines...) Expand all Loading... |
96 /* last row of W_Q18 */ | 104 /* last row of W_Q18 */ |
97 sum2_Q16 = silk_SMULWB( W_Q18[ 24 ], diff_Q14[ 4 ] ); | 105 sum2_Q16 = silk_SMULWB( W_Q18[ 24 ], diff_Q14[ 4 ] ); |
98 sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 4 ] ); | 106 sum1_Q14 = silk_SMLAWB( sum1_Q14, sum2_Q16, diff_Q14[ 4 ] ); |
99 | 107 |
100 silk_assert( sum1_Q14 >= 0 ); | 108 silk_assert( sum1_Q14 >= 0 ); |
101 | 109 |
102 /* find best */ | 110 /* find best */ |
103 if( sum1_Q14 < *rate_dist_Q14 ) { | 111 if( sum1_Q14 < *rate_dist_Q14 ) { |
104 *rate_dist_Q14 = sum1_Q14; | 112 *rate_dist_Q14 = sum1_Q14; |
105 *ind = (opus_int8)k; | 113 *ind = (opus_int8)k; |
| 114 *gain_Q7 = gain_tmp_Q7; |
106 } | 115 } |
107 | 116 |
108 /* Go to next cbk vector */ | 117 /* Go to next cbk vector */ |
109 cb_row_Q7 += LTP_ORDER; | 118 cb_row_Q7 += LTP_ORDER; |
110 } | 119 } |
111 } | 120 } |
OLD | NEW |