michael@0: /***********************************************************************
michael@0: Copyright (c) 2006-2011, Skype Limited. All rights reserved.
michael@0: Redistribution and use in source and binary forms, with or without
michael@0: modification, are permitted provided that the following conditions
michael@0: are met:
michael@0: - Redistributions of source code must retain the above copyright notice,
michael@0: this list of conditions and the following disclaimer.
michael@0: - Redistributions in binary form must reproduce the above copyright
michael@0: notice, this list of conditions and the following disclaimer in the
michael@0: documentation and/or other materials provided with the distribution.
michael@0: - Neither the name of Internet Society, IETF or IETF Trust, nor the
michael@0: names of specific contributors, may be used to endorse or promote
michael@0: products derived from this software without specific prior written
michael@0: permission.
michael@0: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
michael@0: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
michael@0: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
michael@0: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
michael@0: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
michael@0: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
michael@0: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
michael@0: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
michael@0: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
michael@0: POSSIBILITY OF SUCH DAMAGE.
michael@0: ***********************************************************************/
michael@0: 
michael@0: #ifdef HAVE_CONFIG_H
michael@0: #include "config.h"
michael@0: #endif
michael@0: 
michael@0: #include "typedef.h"
michael@0: #include "pitch_est_defines.h"
michael@0: 
michael@0: const opus_int8 silk_CB_lags_stage2_10_ms[ PE_MAX_NB_SUBFR >> 1][ PE_NB_CBKS_STAGE2_10MS ] =
michael@0: {
michael@0:     {0, 1, 0},
michael@0:     {0, 0, 1}
michael@0: };
michael@0: 
michael@0: const opus_int8 silk_CB_lags_stage3_10_ms[ PE_MAX_NB_SUBFR >> 1 ][ PE_NB_CBKS_STAGE3_10MS ] =
michael@0: {
michael@0:     { 0, 0, 1,-1, 1,-1, 2,-2, 2,-2, 3,-3},
michael@0:     { 0, 1, 0, 1,-1, 2,-1, 2,-2, 3,-2, 3}
michael@0: };
michael@0: 
michael@0: const opus_int8 silk_Lag_range_stage3_10_ms[ PE_MAX_NB_SUBFR >> 1 ][ 2 ] =
michael@0: {
michael@0:     {-3, 7},
michael@0:     {-2, 7}
michael@0: };
michael@0: 
michael@0: const opus_int8 silk_CB_lags_stage2[ PE_MAX_NB_SUBFR ][ PE_NB_CBKS_STAGE2_EXT ] =
michael@0: {
michael@0:     {0, 2,-1,-1,-1, 0, 0, 1, 1, 0, 1},
michael@0:     {0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0},
michael@0:     {0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0},
michael@0:     {0,-1, 2, 1, 0, 1, 1, 0, 0,-1,-1}
michael@0: };
michael@0: 
michael@0: const opus_int8 silk_CB_lags_stage3[ PE_MAX_NB_SUBFR ][ PE_NB_CBKS_STAGE3_MAX ] =
michael@0: {
michael@0:     {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},
michael@0:     {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},
michael@0:     {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},
michael@0:     {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}
michael@0: };
michael@0: 
michael@0: const opus_int8 silk_Lag_range_stage3[ SILK_PE_MAX_COMPLEX + 1 ] [ PE_MAX_NB_SUBFR ][ 2 ] =
michael@0: {
michael@0:     /* Lags to search for low number of stage3 cbks */
michael@0:     {
michael@0:         {-5,8},
michael@0:         {-1,6},
michael@0:         {-1,6},
michael@0:         {-4,10}
michael@0:     },
michael@0:     /* Lags to search for middle number of stage3 cbks */
michael@0:     {
michael@0:         {-6,10},
michael@0:         {-2,6},
michael@0:         {-1,6},
michael@0:         {-5,10}
michael@0:     },
michael@0:     /* Lags to search for max number of stage3 cbks */
michael@0:     {
michael@0:         {-9,12},
michael@0:         {-3,7},
michael@0:         {-2,7},
michael@0:         {-7,13}
michael@0:     }
michael@0: };
michael@0: 
michael@0: const opus_int8 silk_nb_cbk_searchs_stage3[ SILK_PE_MAX_COMPLEX + 1 ] =
michael@0: {
michael@0:     PE_NB_CBKS_STAGE3_MIN,
michael@0:     PE_NB_CBKS_STAGE3_MID,
michael@0:     PE_NB_CBKS_STAGE3_MAX
michael@0: };