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