annotate src/opus-1.3/silk/pitch_est_tables.c @ 81:7029a4916348

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