| OLD | NEW |
| (Empty) | |
| 1 /*********************************************************************** |
| 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| 3 Redistribution and use in source and binary forms, with or without |
| 4 modification, are permitted provided that the following conditions |
| 5 are met: |
| 6 - Redistributions of source code must retain the above copyright notice, |
| 7 this list of conditions and the following disclaimer. |
| 8 - Redistributions in binary form must reproduce the above copyright |
| 9 notice, this list of conditions and the following disclaimer in the |
| 10 documentation and/or other materials provided with the distribution. |
| 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| 12 names of specific contributors, may be used to endorse or promote |
| 13 products derived from this software without specific prior written |
| 14 permission. |
| 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” |
| 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 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 |
| 25 POSSIBILITY OF SUCH DAMAGE. |
| 26 ***********************************************************************/ |
| 27 |
| 28 #ifdef HAVE_CONFIG_H |
| 29 #include "config.h" |
| 30 #endif |
| 31 |
| 32 #include "typedef.h" |
| 33 #include "pitch_est_defines.h" |
| 34 |
| 35 const opus_int8 silk_CB_lags_stage2_10_ms[ PE_MAX_NB_SUBFR >> 1][ PE_NB_CBKS_STA
GE2_10MS ] = |
| 36 { |
| 37 {0, 1, 0}, |
| 38 {0, 0, 1} |
| 39 }; |
| 40 |
| 41 const opus_int8 silk_CB_lags_stage3_10_ms[ PE_MAX_NB_SUBFR >> 1 ][ PE_NB_CBKS_ST
AGE3_10MS ] = |
| 42 { |
| 43 { 0, 0, 1,-1, 1,-1, 2,-2, 2,-2, 3,-3}, |
| 44 { 0, 1, 0, 1,-1, 2,-1, 2,-2, 3,-2, 3} |
| 45 }; |
| 46 |
| 47 const opus_int8 silk_Lag_range_stage3_10_ms[ PE_MAX_NB_SUBFR >> 1 ][ 2 ] = |
| 48 { |
| 49 {-3, 7}, |
| 50 {-2, 7} |
| 51 }; |
| 52 |
| 53 const opus_int8 silk_CB_lags_stage2[ PE_MAX_NB_SUBFR ][ PE_NB_CBKS_STAGE2_EXT ]
= |
| 54 { |
| 55 {0, 2,-1,-1,-1, 0, 0, 1, 1, 0, 1}, |
| 56 {0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0}, |
| 57 {0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0}, |
| 58 {0,-1, 2, 1, 0, 1, 1, 0, 0,-1,-1} |
| 59 }; |
| 60 |
| 61 const opus_int8 silk_CB_lags_stage3[ PE_MAX_NB_SUBFR ][ PE_NB_CBKS_STAGE3_MAX ]
= |
| 62 { |
| 63 {0, 0, 1,-1, 0, 1,-1, 0,-1, 1,-2, 2,-2,-2, 2,-3, 2, 3,-3,-4, 3,-4, 4, 4,-5,
5,-6,-5, 6,-7, 6, 5, 8,-9}, |
| 64 {0, 0, 1, 0, 0, 0, 0, 0, 0, 0,-1, 1, 0, 0, 1,-1, 0, 1,-1,-1, 1,-1, 2, 1,-1,
2,-2,-2, 2,-2, 2, 2, 3,-3}, |
| 65 {0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1,-1, 1, 0, 0, 2, 1,-1, 2,-1,-1, 2,-
1, 2, 2,-1, 3,-2,-2,-2, 3}, |
| 66 {0, 1, 0, 0, 1, 0, 1,-1, 2,-1, 2,-1, 2, 3,-2, 3,-2,-2, 4, 4,-3, 5,-3,-4, 6,-
4, 6, 5,-5, 8,-6,-5,-7, 9} |
| 67 }; |
| 68 |
| 69 const opus_int8 silk_Lag_range_stage3[ SILK_PE_MAX_COMPLEX + 1 ] [ PE_MAX_NB_SUB
FR ][ 2 ] = |
| 70 { |
| 71 /* Lags to search for low number of stage3 cbks */ |
| 72 { |
| 73 {-5,8}, |
| 74 {-1,6}, |
| 75 {-1,6}, |
| 76 {-4,10} |
| 77 }, |
| 78 /* Lags to search for middle number of stage3 cbks */ |
| 79 { |
| 80 {-6,10}, |
| 81 {-2,6}, |
| 82 {-1,6}, |
| 83 {-5,10} |
| 84 }, |
| 85 /* Lags to search for max number of stage3 cbks */ |
| 86 { |
| 87 {-9,12}, |
| 88 {-3,7}, |
| 89 {-2,7}, |
| 90 {-7,13} |
| 91 } |
| 92 }; |
| 93 |
| 94 const opus_int8 silk_nb_cbk_searchs_stage3[ SILK_PE_MAX_COMPLEX + 1 ] = |
| 95 { |
| 96 PE_NB_CBKS_STAGE3_MIN, |
| 97 PE_NB_CBKS_STAGE3_MID, |
| 98 PE_NB_CBKS_STAGE3_MAX |
| 99 }; |
| OLD | NEW |