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 12 matching lines...) Expand all Loading... |
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
25 POSSIBILITY OF SUCH DAMAGE. | 25 POSSIBILITY OF SUCH DAMAGE. |
26 ***********************************************************************/ | 26 ***********************************************************************/ |
27 | 27 |
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 #include "tuning_parameters.h" |
33 | 34 |
34 void silk_quant_LTP_gains( | 35 void silk_quant_LTP_gains( |
35 opus_int16 B_Q14[ MAX_NB_SUBFR * LTP_ORDER ], /* I
/O (un)quantized LTP gains */ | 36 opus_int16 B_Q14[ MAX_NB_SUBFR * LTP_ORDER ], /* I
/O (un)quantized LTP gains */ |
36 opus_int8 cbk_index[ MAX_NB_SUBFR ], /* O
Codebook Index */ | 37 opus_int8 cbk_index[ MAX_NB_SUBFR ], /* O
Codebook Index */ |
37 opus_int8 *periodicity_index, /* O
Periodicity Index */ | 38 opus_int8 *periodicity_index, /* O
Periodicity Index */ |
| 39 opus_int32 *sum_log_gain_Q7,
/* I/O Cumulative max predictio
n gain */ |
38 const opus_int32 W_Q18[ MAX_NB_SUBFR*LTP_ORDER*LTP_ORDER ], /* I
Error Weights in Q18 */ | 40 const opus_int32 W_Q18[ MAX_NB_SUBFR*LTP_ORDER*LTP_ORDER ], /* I
Error Weights in Q18 */ |
39 opus_int mu_Q9, /* I
Mu value (R/D tradeoff) */ | 41 opus_int mu_Q9, /* I
Mu value (R/D tradeoff) */ |
40 opus_int lowComplexity, /* I
Flag for low complexity */ | 42 opus_int lowComplexity, /* I
Flag for low complexity */ |
41 const opus_int nb_subfr /* I
number of subframes */ | 43 const opus_int nb_subfr /* I
number of subframes */ |
42 ) | 44 ) |
43 { | 45 { |
44 opus_int j, k, cbk_size; | 46 opus_int j, k, cbk_size; |
45 opus_int8 temp_idx[ MAX_NB_SUBFR ]; | 47 opus_int8 temp_idx[ MAX_NB_SUBFR ]; |
46 const opus_uint8 *cl_ptr_Q5; | 48 const opus_uint8 *cl_ptr_Q5; |
47 const opus_int8 *cbk_ptr_Q7; | 49 const opus_int8 *cbk_ptr_Q7; |
| 50 const opus_uint8 *cbk_gain_ptr_Q7; |
48 const opus_int16 *b_Q14_ptr; | 51 const opus_int16 *b_Q14_ptr; |
49 const opus_int32 *W_Q18_ptr; | 52 const opus_int32 *W_Q18_ptr; |
50 opus_int32 rate_dist_Q14_subfr, rate_dist_Q14, min_rate_dist_Q14; | 53 opus_int32 rate_dist_Q14_subfr, rate_dist_Q14, min_rate_dist_Q14; |
| 54 opus_int32 sum_log_gain_tmp_Q7, best_sum_log_gain_Q7, max_gain
_Q7, gain_Q7; |
51 | 55 |
52 /***************************************************/ | 56 /***************************************************/ |
53 /* iterate over different codebooks with different */ | 57 /* iterate over different codebooks with different */ |
54 /* rates/distortions, and choose best */ | 58 /* rates/distortions, and choose best */ |
55 /***************************************************/ | 59 /***************************************************/ |
56 min_rate_dist_Q14 = silk_int32_MAX; | 60 min_rate_dist_Q14 = silk_int32_MAX; |
| 61 best_sum_log_gain_Q7 = 0; |
57 for( k = 0; k < 3; k++ ) { | 62 for( k = 0; k < 3; k++ ) { |
| 63 /* Safety margin for pitch gain control, to take into account factors |
| 64 such as state rescaling/rewhitening. */ |
| 65 opus_int32 gain_safety = SILK_FIX_CONST( 0.4, 7 ); |
| 66 |
58 cl_ptr_Q5 = silk_LTP_gain_BITS_Q5_ptrs[ k ]; | 67 cl_ptr_Q5 = silk_LTP_gain_BITS_Q5_ptrs[ k ]; |
59 cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ k ]; | 68 cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ k ]; |
| 69 cbk_gain_ptr_Q7 = silk_LTP_vq_gain_ptrs_Q7[ k ]; |
60 cbk_size = silk_LTP_vq_sizes[ k ]; | 70 cbk_size = silk_LTP_vq_sizes[ k ]; |
61 | 71 |
62 /* Set up pointer to first subframe */ | 72 /* Set up pointer to first subframe */ |
63 W_Q18_ptr = W_Q18; | 73 W_Q18_ptr = W_Q18; |
64 b_Q14_ptr = B_Q14; | 74 b_Q14_ptr = B_Q14; |
65 | 75 |
66 rate_dist_Q14 = 0; | 76 rate_dist_Q14 = 0; |
| 77 sum_log_gain_tmp_Q7 = *sum_log_gain_Q7; |
67 for( j = 0; j < nb_subfr; j++ ) { | 78 for( j = 0; j < nb_subfr; j++ ) { |
| 79 max_gain_Q7 = silk_log2lin( ( SILK_FIX_CONST( MAX_SUM_LO
G_GAIN_DB / 6.0, 7 ) - sum_log_gain_tmp_Q7 ) |
| 80
+ SILK_FIX_CONST( 7, 7 ) ) - gain_safety; |
| 81 |
68 silk_VQ_WMat_EC( | 82 silk_VQ_WMat_EC( |
69 &temp_idx[ j ], /* O index of best codebook vector
*/ | 83 &temp_idx[ j ], /* O index of best codebook vector
*/ |
70 &rate_dist_Q14_subfr, /* O best weighted quantization error
+ mu * rate */ | 84 &rate_dist_Q14_subfr, /* O best weighted quantization error
+ mu * rate */ |
| 85 &gain_Q7, /* O sum of absolute
LTP coefficients */ |
71 b_Q14_ptr, /* I input vector to be quantized
*/ | 86 b_Q14_ptr, /* I input vector to be quantized
*/ |
72 W_Q18_ptr, /* I weighting matrix
*/ | 87 W_Q18_ptr, /* I weighting matrix
*/ |
73 cbk_ptr_Q7, /* I codebook
*/ | 88 cbk_ptr_Q7, /* I codebook
*/ |
| 89 cbk_gain_ptr_Q7, /* I codebook effective gains
*/ |
74 cl_ptr_Q5, /* I code length for each codebook ve
ctor */ | 90 cl_ptr_Q5, /* I code length for each codebook ve
ctor */ |
75 mu_Q9, /* I tradeoff between weighted error
and rate */ | 91 mu_Q9, /* I tradeoff between weighted error
and rate */ |
| 92 max_gain_Q7, /* I maximum sum of a
bsolute LTP coefficients */ |
76 cbk_size /* I number of vectors in codebook
*/ | 93 cbk_size /* I number of vectors in codebook
*/ |
77 ); | 94 ); |
78 | 95 |
79 rate_dist_Q14 = silk_ADD_POS_SAT32( rate_dist_Q14, rate_dist_Q14_sub
fr ); | 96 rate_dist_Q14 = silk_ADD_POS_SAT32( rate_dist_Q14, rate_dist_Q14_sub
fr ); |
| 97 sum_log_gain_tmp_Q7 = silk_max(0, sum_log_gain_tmp_Q7 |
| 98 + silk_lin2log( gain_safety + gain_Q7 ) - SILK_F
IX_CONST( 7, 7 )); |
80 | 99 |
81 b_Q14_ptr += LTP_ORDER; | 100 b_Q14_ptr += LTP_ORDER; |
82 W_Q18_ptr += LTP_ORDER * LTP_ORDER; | 101 W_Q18_ptr += LTP_ORDER * LTP_ORDER; |
83 } | 102 } |
84 | 103 |
85 /* Avoid never finding a codebook */ | 104 /* Avoid never finding a codebook */ |
86 rate_dist_Q14 = silk_min( silk_int32_MAX - 1, rate_dist_Q14 ); | 105 rate_dist_Q14 = silk_min( silk_int32_MAX - 1, rate_dist_Q14 ); |
87 | 106 |
88 if( rate_dist_Q14 < min_rate_dist_Q14 ) { | 107 if( rate_dist_Q14 < min_rate_dist_Q14 ) { |
89 min_rate_dist_Q14 = rate_dist_Q14; | 108 min_rate_dist_Q14 = rate_dist_Q14; |
90 *periodicity_index = (opus_int8)k; | 109 *periodicity_index = (opus_int8)k; |
91 silk_memcpy( cbk_index, temp_idx, nb_subfr * sizeof( opus_int8 ) ); | 110 silk_memcpy( cbk_index, temp_idx, nb_subfr * sizeof( opus_int8 ) ); |
| 111 best_sum_log_gain_Q7 = sum_log_gain_tmp_Q7; |
92 } | 112 } |
93 | 113 |
94 /* Break early in low-complexity mode if rate distortion is below thresh
old */ | 114 /* Break early in low-complexity mode if rate distortion is below thresh
old */ |
95 if( lowComplexity && ( rate_dist_Q14 < silk_LTP_gain_middle_avg_RD_Q14 )
) { | 115 if( lowComplexity && ( rate_dist_Q14 < silk_LTP_gain_middle_avg_RD_Q14 )
) { |
96 break; | 116 break; |
97 } | 117 } |
98 } | 118 } |
99 | 119 |
100 cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ *periodicity_index ]; | 120 cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ *periodicity_index ]; |
101 for( j = 0; j < nb_subfr; j++ ) { | 121 for( j = 0; j < nb_subfr; j++ ) { |
102 for( k = 0; k < LTP_ORDER; k++ ) { | 122 for( k = 0; k < LTP_ORDER; k++ ) { |
103 B_Q14[ j * LTP_ORDER + k ] = silk_LSHIFT( cbk_ptr_Q7[ cbk_index[ j ]
* LTP_ORDER + k ], 7 ); | 123 B_Q14[ j * LTP_ORDER + k ] = silk_LSHIFT( cbk_ptr_Q7[ cbk_index[ j ]
* LTP_ORDER + k ], 7 ); |
104 } | 124 } |
105 } | 125 } |
| 126 *sum_log_gain_Q7 = best_sum_log_gain_Q7; |
106 } | 127 } |
107 | 128 |
OLD | NEW |