cannam@154
|
1 /***********************************************************************
|
cannam@154
|
2 Copyright (c) 2014 Vidyo.
|
cannam@154
|
3 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
cannam@154
|
4 Redistribution and use in source and binary forms, with or without
|
cannam@154
|
5 modification, are permitted provided that the following conditions
|
cannam@154
|
6 are met:
|
cannam@154
|
7 - Redistributions of source code must retain the above copyright notice,
|
cannam@154
|
8 this list of conditions and the following disclaimer.
|
cannam@154
|
9 - Redistributions in binary form must reproduce the above copyright
|
cannam@154
|
10 notice, this list of conditions and the following disclaimer in the
|
cannam@154
|
11 documentation and/or other materials provided with the distribution.
|
cannam@154
|
12 - Neither the name of Internet Society, IETF or IETF Trust, nor the
|
cannam@154
|
13 names of specific contributors, may be used to endorse or promote
|
cannam@154
|
14 products derived from this software without specific prior written
|
cannam@154
|
15 permission.
|
cannam@154
|
16 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
cannam@154
|
17 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
cannam@154
|
18 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
cannam@154
|
19 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
cannam@154
|
20 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
cannam@154
|
21 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
cannam@154
|
22 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
cannam@154
|
23 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
cannam@154
|
24 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
cannam@154
|
25 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
cannam@154
|
26 POSSIBILITY OF SUCH DAMAGE.
|
cannam@154
|
27 ***********************************************************************/
|
cannam@154
|
28 #ifndef SILK_NSQ_H
|
cannam@154
|
29 #define SILK_NSQ_H
|
cannam@154
|
30
|
cannam@154
|
31 #include "SigProc_FIX.h"
|
cannam@154
|
32
|
cannam@154
|
33 #undef silk_short_prediction_create_arch_coef
|
cannam@154
|
34
|
cannam@154
|
35 static OPUS_INLINE opus_int32 silk_noise_shape_quantizer_short_prediction_c(const opus_int32 *buf32, const opus_int16 *coef16, opus_int order)
|
cannam@154
|
36 {
|
cannam@154
|
37 opus_int32 out;
|
cannam@154
|
38 silk_assert( order == 10 || order == 16 );
|
cannam@154
|
39
|
cannam@154
|
40 /* Avoids introducing a bias because silk_SMLAWB() always rounds to -inf */
|
cannam@154
|
41 out = silk_RSHIFT( order, 1 );
|
cannam@154
|
42 out = silk_SMLAWB( out, buf32[ 0 ], coef16[ 0 ] );
|
cannam@154
|
43 out = silk_SMLAWB( out, buf32[ -1 ], coef16[ 1 ] );
|
cannam@154
|
44 out = silk_SMLAWB( out, buf32[ -2 ], coef16[ 2 ] );
|
cannam@154
|
45 out = silk_SMLAWB( out, buf32[ -3 ], coef16[ 3 ] );
|
cannam@154
|
46 out = silk_SMLAWB( out, buf32[ -4 ], coef16[ 4 ] );
|
cannam@154
|
47 out = silk_SMLAWB( out, buf32[ -5 ], coef16[ 5 ] );
|
cannam@154
|
48 out = silk_SMLAWB( out, buf32[ -6 ], coef16[ 6 ] );
|
cannam@154
|
49 out = silk_SMLAWB( out, buf32[ -7 ], coef16[ 7 ] );
|
cannam@154
|
50 out = silk_SMLAWB( out, buf32[ -8 ], coef16[ 8 ] );
|
cannam@154
|
51 out = silk_SMLAWB( out, buf32[ -9 ], coef16[ 9 ] );
|
cannam@154
|
52
|
cannam@154
|
53 if( order == 16 )
|
cannam@154
|
54 {
|
cannam@154
|
55 out = silk_SMLAWB( out, buf32[ -10 ], coef16[ 10 ] );
|
cannam@154
|
56 out = silk_SMLAWB( out, buf32[ -11 ], coef16[ 11 ] );
|
cannam@154
|
57 out = silk_SMLAWB( out, buf32[ -12 ], coef16[ 12 ] );
|
cannam@154
|
58 out = silk_SMLAWB( out, buf32[ -13 ], coef16[ 13 ] );
|
cannam@154
|
59 out = silk_SMLAWB( out, buf32[ -14 ], coef16[ 14 ] );
|
cannam@154
|
60 out = silk_SMLAWB( out, buf32[ -15 ], coef16[ 15 ] );
|
cannam@154
|
61 }
|
cannam@154
|
62 return out;
|
cannam@154
|
63 }
|
cannam@154
|
64
|
cannam@154
|
65 #define silk_noise_shape_quantizer_short_prediction(in, coef, coefRev, order, arch) ((void)arch,silk_noise_shape_quantizer_short_prediction_c(in, coef, order))
|
cannam@154
|
66
|
cannam@154
|
67 static OPUS_INLINE opus_int32 silk_NSQ_noise_shape_feedback_loop_c(const opus_int32 *data0, opus_int32 *data1, const opus_int16 *coef, opus_int order)
|
cannam@154
|
68 {
|
cannam@154
|
69 opus_int32 out;
|
cannam@154
|
70 opus_int32 tmp1, tmp2;
|
cannam@154
|
71 opus_int j;
|
cannam@154
|
72
|
cannam@154
|
73 tmp2 = data0[0];
|
cannam@154
|
74 tmp1 = data1[0];
|
cannam@154
|
75 data1[0] = tmp2;
|
cannam@154
|
76
|
cannam@154
|
77 out = silk_RSHIFT(order, 1);
|
cannam@154
|
78 out = silk_SMLAWB(out, tmp2, coef[0]);
|
cannam@154
|
79
|
cannam@154
|
80 for (j = 2; j < order; j += 2) {
|
cannam@154
|
81 tmp2 = data1[j - 1];
|
cannam@154
|
82 data1[j - 1] = tmp1;
|
cannam@154
|
83 out = silk_SMLAWB(out, tmp1, coef[j - 1]);
|
cannam@154
|
84 tmp1 = data1[j + 0];
|
cannam@154
|
85 data1[j + 0] = tmp2;
|
cannam@154
|
86 out = silk_SMLAWB(out, tmp2, coef[j]);
|
cannam@154
|
87 }
|
cannam@154
|
88 data1[order - 1] = tmp1;
|
cannam@154
|
89 out = silk_SMLAWB(out, tmp1, coef[order - 1]);
|
cannam@154
|
90 /* Q11 -> Q12 */
|
cannam@154
|
91 out = silk_LSHIFT32( out, 1 );
|
cannam@154
|
92 return out;
|
cannam@154
|
93 }
|
cannam@154
|
94
|
cannam@154
|
95 #define silk_NSQ_noise_shape_feedback_loop(data0, data1, coef, order, arch) ((void)arch,silk_NSQ_noise_shape_feedback_loop_c(data0, data1, coef, order))
|
cannam@154
|
96
|
cannam@154
|
97 #if defined(OPUS_ARM_MAY_HAVE_NEON_INTR)
|
cannam@154
|
98 #include "arm/NSQ_neon.h"
|
cannam@154
|
99 #endif
|
cannam@154
|
100
|
cannam@154
|
101 #endif /* SILK_NSQ_H */
|