media/libopus/silk/quant_LTP_gains.c@6474c204b198 (annotated)
media/libopus/silk/quant_LTP_gains.c
Wed, 31 Dec 2014 06:09:35 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 06:09:35 +0100
- changeset 0
- 6474c204b198
- permissions
- -rw-r--r--
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
| michael@0 | 1 | /*********************************************************************** |
| michael@0 | 2 | Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| michael@0 | 3 | Redistribution and use in source and binary forms, with or without |
| michael@0 | 4 | modification, are permitted provided that the following conditions |
| michael@0 | 5 | are met: |
| michael@0 | 6 | - Redistributions of source code must retain the above copyright notice, |
| michael@0 | 7 | this list of conditions and the following disclaimer. |
| michael@0 | 8 | - Redistributions in binary form must reproduce the above copyright |
| michael@0 | 9 | notice, this list of conditions and the following disclaimer in the |
| michael@0 | 10 | documentation and/or other materials provided with the distribution. |
| michael@0 | 11 | - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| michael@0 | 12 | names of specific contributors, may be used to endorse or promote |
| michael@0 | 13 | products derived from this software without specific prior written |
| michael@0 | 14 | permission. |
| michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| michael@0 | 16 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| michael@0 | 18 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| michael@0 | 19 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| michael@0 | 20 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| michael@0 | 21 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| michael@0 | 22 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| michael@0 | 23 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| michael@0 | 24 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| michael@0 | 25 | POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 26 | ***********************************************************************/ |
| michael@0 | 27 | |
| michael@0 | 28 | #ifdef HAVE_CONFIG_H |
| michael@0 | 29 | #include "config.h" |
| michael@0 | 30 | #endif |
| michael@0 | 31 | |
| michael@0 | 32 | #include "main.h" |
| michael@0 | 33 | #include "tuning_parameters.h" |
| michael@0 | 34 | |
| michael@0 | 35 | void silk_quant_LTP_gains( |
| michael@0 | 36 | opus_int16 B_Q14[ MAX_NB_SUBFR * LTP_ORDER ], /* I/O (un)quantized LTP gains */ |
| michael@0 | 37 | opus_int8 cbk_index[ MAX_NB_SUBFR ], /* O Codebook Index */ |
| michael@0 | 38 | opus_int8 *periodicity_index, /* O Periodicity Index */ |
| michael@0 | 39 | opus_int32 *sum_log_gain_Q7, /* I/O Cumulative max prediction gain */ |
| michael@0 | 40 | const opus_int32 W_Q18[ MAX_NB_SUBFR*LTP_ORDER*LTP_ORDER ], /* I Error Weights in Q18 */ |
| michael@0 | 41 | opus_int mu_Q9, /* I Mu value (R/D tradeoff) */ |
| michael@0 | 42 | opus_int lowComplexity, /* I Flag for low complexity */ |
| michael@0 | 43 | const opus_int nb_subfr /* I number of subframes */ |
| michael@0 | 44 | ) |
| michael@0 | 45 | { |
| michael@0 | 46 | opus_int j, k, cbk_size; |
| michael@0 | 47 | opus_int8 temp_idx[ MAX_NB_SUBFR ]; |
| michael@0 | 48 | const opus_uint8 *cl_ptr_Q5; |
| michael@0 | 49 | const opus_int8 *cbk_ptr_Q7; |
| michael@0 | 50 | const opus_uint8 *cbk_gain_ptr_Q7; |
| michael@0 | 51 | const opus_int16 *b_Q14_ptr; |
| michael@0 | 52 | const opus_int32 *W_Q18_ptr; |
| michael@0 | 53 | opus_int32 rate_dist_Q14_subfr, rate_dist_Q14, min_rate_dist_Q14; |
| michael@0 | 54 | opus_int32 sum_log_gain_tmp_Q7, best_sum_log_gain_Q7, max_gain_Q7, gain_Q7; |
| michael@0 | 55 | |
| michael@0 | 56 | /***************************************************/ |
| michael@0 | 57 | /* iterate over different codebooks with different */ |
| michael@0 | 58 | /* rates/distortions, and choose best */ |
| michael@0 | 59 | /***************************************************/ |
| michael@0 | 60 | min_rate_dist_Q14 = silk_int32_MAX; |
| michael@0 | 61 | best_sum_log_gain_Q7 = 0; |
| michael@0 | 62 | for( k = 0; k < 3; k++ ) { |
| michael@0 | 63 | /* Safety margin for pitch gain control, to take into account factors |
| michael@0 | 64 | such as state rescaling/rewhitening. */ |
| michael@0 | 65 | opus_int32 gain_safety = SILK_FIX_CONST( 0.4, 7 ); |
| michael@0 | 66 | |
| michael@0 | 67 | cl_ptr_Q5 = silk_LTP_gain_BITS_Q5_ptrs[ k ]; |
| michael@0 | 68 | cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ k ]; |
| michael@0 | 69 | cbk_gain_ptr_Q7 = silk_LTP_vq_gain_ptrs_Q7[ k ]; |
| michael@0 | 70 | cbk_size = silk_LTP_vq_sizes[ k ]; |
| michael@0 | 71 | |
| michael@0 | 72 | /* Set up pointer to first subframe */ |
| michael@0 | 73 | W_Q18_ptr = W_Q18; |
| michael@0 | 74 | b_Q14_ptr = B_Q14; |
| michael@0 | 75 | |
| michael@0 | 76 | rate_dist_Q14 = 0; |
| michael@0 | 77 | sum_log_gain_tmp_Q7 = *sum_log_gain_Q7; |
| michael@0 | 78 | for( j = 0; j < nb_subfr; j++ ) { |
| michael@0 | 79 | max_gain_Q7 = silk_log2lin( ( SILK_FIX_CONST( MAX_SUM_LOG_GAIN_DB / 6.0, 7 ) - sum_log_gain_tmp_Q7 ) |
| michael@0 | 80 | + SILK_FIX_CONST( 7, 7 ) ) - gain_safety; |
| michael@0 | 81 | |
| michael@0 | 82 | silk_VQ_WMat_EC( |
| michael@0 | 83 | &temp_idx[ j ], /* O index of best codebook vector */ |
| michael@0 | 84 | &rate_dist_Q14_subfr, /* O best weighted quantization error + mu * rate */ |
| michael@0 | 85 | &gain_Q7, /* O sum of absolute LTP coefficients */ |
| michael@0 | 86 | b_Q14_ptr, /* I input vector to be quantized */ |
| michael@0 | 87 | W_Q18_ptr, /* I weighting matrix */ |
| michael@0 | 88 | cbk_ptr_Q7, /* I codebook */ |
| michael@0 | 89 | cbk_gain_ptr_Q7, /* I codebook effective gains */ |
| michael@0 | 90 | cl_ptr_Q5, /* I code length for each codebook vector */ |
| michael@0 | 91 | mu_Q9, /* I tradeoff between weighted error and rate */ |
| michael@0 | 92 | max_gain_Q7, /* I maximum sum of absolute LTP coefficients */ |
| michael@0 | 93 | cbk_size /* I number of vectors in codebook */ |
| michael@0 | 94 | ); |
| michael@0 | 95 | |
| michael@0 | 96 | rate_dist_Q14 = silk_ADD_POS_SAT32( rate_dist_Q14, rate_dist_Q14_subfr ); |
| michael@0 | 97 | sum_log_gain_tmp_Q7 = silk_max(0, sum_log_gain_tmp_Q7 |
| michael@0 | 98 | + silk_lin2log( gain_safety + gain_Q7 ) - SILK_FIX_CONST( 7, 7 )); |
| michael@0 | 99 | |
| michael@0 | 100 | b_Q14_ptr += LTP_ORDER; |
| michael@0 | 101 | W_Q18_ptr += LTP_ORDER * LTP_ORDER; |
| michael@0 | 102 | } |
| michael@0 | 103 | |
| michael@0 | 104 | /* Avoid never finding a codebook */ |
| michael@0 | 105 | rate_dist_Q14 = silk_min( silk_int32_MAX - 1, rate_dist_Q14 ); |
| michael@0 | 106 | |
| michael@0 | 107 | if( rate_dist_Q14 < min_rate_dist_Q14 ) { |
| michael@0 | 108 | min_rate_dist_Q14 = rate_dist_Q14; |
| michael@0 | 109 | *periodicity_index = (opus_int8)k; |
| michael@0 | 110 | silk_memcpy( cbk_index, temp_idx, nb_subfr * sizeof( opus_int8 ) ); |
| michael@0 | 111 | best_sum_log_gain_Q7 = sum_log_gain_tmp_Q7; |
| michael@0 | 112 | } |
| michael@0 | 113 | |
| michael@0 | 114 | /* Break early in low-complexity mode if rate distortion is below threshold */ |
| michael@0 | 115 | if( lowComplexity && ( rate_dist_Q14 < silk_LTP_gain_middle_avg_RD_Q14 ) ) { |
| michael@0 | 116 | break; |
| michael@0 | 117 | } |
| michael@0 | 118 | } |
| michael@0 | 119 | |
| michael@0 | 120 | cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ *periodicity_index ]; |
| michael@0 | 121 | for( j = 0; j < nb_subfr; j++ ) { |
| michael@0 | 122 | for( k = 0; k < LTP_ORDER; k++ ) { |
| michael@0 | 123 | B_Q14[ j * LTP_ORDER + k ] = silk_LSHIFT( cbk_ptr_Q7[ cbk_index[ j ] * LTP_ORDER + k ], 7 ); |
| michael@0 | 124 | } |
| michael@0 | 125 | } |
| michael@0 | 126 | *sum_log_gain_Q7 = best_sum_log_gain_Q7; |
| michael@0 | 127 | } |
| michael@0 | 128 |
