cannam@154
|
1 /***********************************************************************
|
cannam@154
|
2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
cannam@154
|
3 Redistribution and use in source and binary forms, with or without
|
cannam@154
|
4 modification, are permitted provided that the following conditions
|
cannam@154
|
5 are met:
|
cannam@154
|
6 - Redistributions of source code must retain the above copyright notice,
|
cannam@154
|
7 this list of conditions and the following disclaimer.
|
cannam@154
|
8 - Redistributions in binary form must reproduce the above copyright
|
cannam@154
|
9 notice, this list of conditions and the following disclaimer in the
|
cannam@154
|
10 documentation and/or other materials provided with the distribution.
|
cannam@154
|
11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
|
cannam@154
|
12 names of specific contributors, may be used to endorse or promote
|
cannam@154
|
13 products derived from this software without specific prior written
|
cannam@154
|
14 permission.
|
cannam@154
|
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
cannam@154
|
16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
cannam@154
|
17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
cannam@154
|
18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
cannam@154
|
19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
cannam@154
|
20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
cannam@154
|
21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
cannam@154
|
22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
cannam@154
|
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
cannam@154
|
24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
cannam@154
|
25 POSSIBILITY OF SUCH DAMAGE.
|
cannam@154
|
26 ***********************************************************************/
|
cannam@154
|
27
|
cannam@154
|
28 #ifdef HAVE_CONFIG_H
|
cannam@154
|
29 #include "config.h"
|
cannam@154
|
30 #endif
|
cannam@154
|
31
|
cannam@154
|
32 #include "main_FIX.h"
|
cannam@154
|
33 #include "tuning_parameters.h"
|
cannam@154
|
34
|
cannam@154
|
35 void silk_find_LTP_FIX(
|
cannam@154
|
36 opus_int32 XXLTP_Q17[ MAX_NB_SUBFR * LTP_ORDER * LTP_ORDER ], /* O Correlation matrix */
|
cannam@154
|
37 opus_int32 xXLTP_Q17[ MAX_NB_SUBFR * LTP_ORDER ], /* O Correlation vector */
|
cannam@154
|
38 const opus_int16 r_ptr[], /* I Residual signal after LPC */
|
cannam@154
|
39 const opus_int lag[ MAX_NB_SUBFR ], /* I LTP lags */
|
cannam@154
|
40 const opus_int subfr_length, /* I Subframe length */
|
cannam@154
|
41 const opus_int nb_subfr, /* I Number of subframes */
|
cannam@154
|
42 int arch /* I Run-time architecture */
|
cannam@154
|
43 )
|
cannam@154
|
44 {
|
cannam@154
|
45 opus_int i, k, extra_shifts;
|
cannam@154
|
46 opus_int xx_shifts, xX_shifts, XX_shifts;
|
cannam@154
|
47 const opus_int16 *lag_ptr;
|
cannam@154
|
48 opus_int32 *XXLTP_Q17_ptr, *xXLTP_Q17_ptr;
|
cannam@154
|
49 opus_int32 xx, nrg, temp;
|
cannam@154
|
50
|
cannam@154
|
51 xXLTP_Q17_ptr = xXLTP_Q17;
|
cannam@154
|
52 XXLTP_Q17_ptr = XXLTP_Q17;
|
cannam@154
|
53 for( k = 0; k < nb_subfr; k++ ) {
|
cannam@154
|
54 lag_ptr = r_ptr - ( lag[ k ] + LTP_ORDER / 2 );
|
cannam@154
|
55
|
cannam@154
|
56 silk_sum_sqr_shift( &xx, &xx_shifts, r_ptr, subfr_length + LTP_ORDER ); /* xx in Q( -xx_shifts ) */
|
cannam@154
|
57 silk_corrMatrix_FIX( lag_ptr, subfr_length, LTP_ORDER, XXLTP_Q17_ptr, &nrg, &XX_shifts, arch ); /* XXLTP_Q17_ptr and nrg in Q( -XX_shifts ) */
|
cannam@154
|
58 extra_shifts = xx_shifts - XX_shifts;
|
cannam@154
|
59 if( extra_shifts > 0 ) {
|
cannam@154
|
60 /* Shift XX */
|
cannam@154
|
61 xX_shifts = xx_shifts;
|
cannam@154
|
62 for( i = 0; i < LTP_ORDER * LTP_ORDER; i++ ) {
|
cannam@154
|
63 XXLTP_Q17_ptr[ i ] = silk_RSHIFT32( XXLTP_Q17_ptr[ i ], extra_shifts ); /* Q( -xX_shifts ) */
|
cannam@154
|
64 }
|
cannam@154
|
65 nrg = silk_RSHIFT32( nrg, extra_shifts ); /* Q( -xX_shifts ) */
|
cannam@154
|
66 } else if( extra_shifts < 0 ) {
|
cannam@154
|
67 /* Shift xx */
|
cannam@154
|
68 xX_shifts = XX_shifts;
|
cannam@154
|
69 xx = silk_RSHIFT32( xx, -extra_shifts ); /* Q( -xX_shifts ) */
|
cannam@154
|
70 } else {
|
cannam@154
|
71 xX_shifts = xx_shifts;
|
cannam@154
|
72 }
|
cannam@154
|
73 silk_corrVector_FIX( lag_ptr, r_ptr, subfr_length, LTP_ORDER, xXLTP_Q17_ptr, xX_shifts, arch ); /* xXLTP_Q17_ptr in Q( -xX_shifts ) */
|
cannam@154
|
74
|
cannam@154
|
75 /* At this point all correlations are in Q(-xX_shifts) */
|
cannam@154
|
76 temp = silk_SMLAWB( 1, nrg, SILK_FIX_CONST( LTP_CORR_INV_MAX, 16 ) );
|
cannam@154
|
77 temp = silk_max( temp, xx );
|
cannam@154
|
78 TIC(div)
|
cannam@154
|
79 #if 0
|
cannam@154
|
80 for( i = 0; i < LTP_ORDER * LTP_ORDER; i++ ) {
|
cannam@154
|
81 XXLTP_Q17_ptr[ i ] = silk_DIV32_varQ( XXLTP_Q17_ptr[ i ], temp, 17 );
|
cannam@154
|
82 }
|
cannam@154
|
83 for( i = 0; i < LTP_ORDER; i++ ) {
|
cannam@154
|
84 xXLTP_Q17_ptr[ i ] = silk_DIV32_varQ( xXLTP_Q17_ptr[ i ], temp, 17 );
|
cannam@154
|
85 }
|
cannam@154
|
86 #else
|
cannam@154
|
87 for( i = 0; i < LTP_ORDER * LTP_ORDER; i++ ) {
|
cannam@154
|
88 XXLTP_Q17_ptr[ i ] = (opus_int32)( silk_LSHIFT64( (opus_int64)XXLTP_Q17_ptr[ i ], 17 ) / temp );
|
cannam@154
|
89 }
|
cannam@154
|
90 for( i = 0; i < LTP_ORDER; i++ ) {
|
cannam@154
|
91 xXLTP_Q17_ptr[ i ] = (opus_int32)( silk_LSHIFT64( (opus_int64)xXLTP_Q17_ptr[ i ], 17 ) / temp );
|
cannam@154
|
92 }
|
cannam@154
|
93 #endif
|
cannam@154
|
94 TOC(div)
|
cannam@154
|
95 r_ptr += subfr_length;
|
cannam@154
|
96 XXLTP_Q17_ptr += LTP_ORDER * LTP_ORDER;
|
cannam@154
|
97 xXLTP_Q17_ptr += LTP_ORDER;
|
cannam@154
|
98 }
|
cannam@154
|
99 }
|