|
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 "main_FIX.h"
|
|
Chris@69
|
33
|
|
Chris@69
|
34 #if defined(MIPSr1_ASM)
|
|
Chris@69
|
35 #include "mips/warped_autocorrelation_FIX_mipsr1.h"
|
|
Chris@69
|
36 #endif
|
|
Chris@69
|
37
|
|
Chris@69
|
38
|
|
Chris@69
|
39 /* Autocorrelations for a warped frequency axis */
|
|
Chris@69
|
40 void silk_warped_autocorrelation_FIX_c(
|
|
Chris@69
|
41 opus_int32 *corr, /* O Result [order + 1] */
|
|
Chris@69
|
42 opus_int *scale, /* O Scaling of the correlation vector */
|
|
Chris@69
|
43 const opus_int16 *input, /* I Input data to correlate */
|
|
Chris@69
|
44 const opus_int warping_Q16, /* I Warping coefficient */
|
|
Chris@69
|
45 const opus_int length, /* I Length of input */
|
|
Chris@69
|
46 const opus_int order /* I Correlation order (even) */
|
|
Chris@69
|
47 )
|
|
Chris@69
|
48 {
|
|
Chris@69
|
49 opus_int n, i, lsh;
|
|
Chris@69
|
50 opus_int32 tmp1_QS, tmp2_QS;
|
|
Chris@69
|
51 opus_int32 state_QS[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 };
|
|
Chris@69
|
52 opus_int64 corr_QC[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 };
|
|
Chris@69
|
53
|
|
Chris@69
|
54 /* Order must be even */
|
|
Chris@69
|
55 celt_assert( ( order & 1 ) == 0 );
|
|
Chris@69
|
56 silk_assert( 2 * QS - QC >= 0 );
|
|
Chris@69
|
57
|
|
Chris@69
|
58 /* Loop over samples */
|
|
Chris@69
|
59 for( n = 0; n < length; n++ ) {
|
|
Chris@69
|
60 tmp1_QS = silk_LSHIFT32( (opus_int32)input[ n ], QS );
|
|
Chris@69
|
61 /* Loop over allpass sections */
|
|
Chris@69
|
62 for( i = 0; i < order; i += 2 ) {
|
|
Chris@69
|
63 /* Output of allpass section */
|
|
Chris@69
|
64 tmp2_QS = silk_SMLAWB( state_QS[ i ], state_QS[ i + 1 ] - tmp1_QS, warping_Q16 );
|
|
Chris@69
|
65 state_QS[ i ] = tmp1_QS;
|
|
Chris@69
|
66 corr_QC[ i ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
|
|
Chris@69
|
67 /* Output of allpass section */
|
|
Chris@69
|
68 tmp1_QS = silk_SMLAWB( state_QS[ i + 1 ], state_QS[ i + 2 ] - tmp2_QS, warping_Q16 );
|
|
Chris@69
|
69 state_QS[ i + 1 ] = tmp2_QS;
|
|
Chris@69
|
70 corr_QC[ i + 1 ] += silk_RSHIFT64( silk_SMULL( tmp2_QS, state_QS[ 0 ] ), 2 * QS - QC );
|
|
Chris@69
|
71 }
|
|
Chris@69
|
72 state_QS[ order ] = tmp1_QS;
|
|
Chris@69
|
73 corr_QC[ order ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
|
|
Chris@69
|
74 }
|
|
Chris@69
|
75
|
|
Chris@69
|
76 lsh = silk_CLZ64( corr_QC[ 0 ] ) - 35;
|
|
Chris@69
|
77 lsh = silk_LIMIT( lsh, -12 - QC, 30 - QC );
|
|
Chris@69
|
78 *scale = -( QC + lsh );
|
|
Chris@69
|
79 silk_assert( *scale >= -30 && *scale <= 12 );
|
|
Chris@69
|
80 if( lsh >= 0 ) {
|
|
Chris@69
|
81 for( i = 0; i < order + 1; i++ ) {
|
|
Chris@69
|
82 corr[ i ] = (opus_int32)silk_CHECK_FIT32( silk_LSHIFT64( corr_QC[ i ], lsh ) );
|
|
Chris@69
|
83 }
|
|
Chris@69
|
84 } else {
|
|
Chris@69
|
85 for( i = 0; i < order + 1; i++ ) {
|
|
Chris@69
|
86 corr[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( corr_QC[ i ], -lsh ) );
|
|
Chris@69
|
87 }
|
|
Chris@69
|
88 }
|
|
Chris@69
|
89 silk_assert( corr_QC[ 0 ] >= 0 ); /* If breaking, decrease QC*/
|
|
Chris@69
|
90 }
|
