annotate src/opus-1.3/silk/fixed/schur_FIX.c @ 79:91c729825bca pa_catalina

Update build for AUDIO_COMPONENT_FIX
author Chris Cannam
date Wed, 30 Oct 2019 12:40:34 +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 "SigProc_FIX.h"
Chris@69 33
Chris@69 34 /* Faster than schur64(), but much less accurate. */
Chris@69 35 /* uses SMLAWB(), requiring armv5E and higher. */
Chris@69 36 opus_int32 silk_schur( /* O Returns residual energy */
Chris@69 37 opus_int16 *rc_Q15, /* O reflection coefficients [order] Q15 */
Chris@69 38 const opus_int32 *c, /* I correlations [order+1] */
Chris@69 39 const opus_int32 order /* I prediction order */
Chris@69 40 )
Chris@69 41 {
Chris@69 42 opus_int k, n, lz;
Chris@69 43 opus_int32 C[ SILK_MAX_ORDER_LPC + 1 ][ 2 ];
Chris@69 44 opus_int32 Ctmp1, Ctmp2, rc_tmp_Q15;
Chris@69 45
Chris@69 46 celt_assert( order >= 0 && order <= SILK_MAX_ORDER_LPC );
Chris@69 47
Chris@69 48 /* Get number of leading zeros */
Chris@69 49 lz = silk_CLZ32( c[ 0 ] );
Chris@69 50
Chris@69 51 /* Copy correlations and adjust level to Q30 */
Chris@69 52 k = 0;
Chris@69 53 if( lz < 2 ) {
Chris@69 54 /* lz must be 1, so shift one to the right */
Chris@69 55 do {
Chris@69 56 C[ k ][ 0 ] = C[ k ][ 1 ] = silk_RSHIFT( c[ k ], 1 );
Chris@69 57 } while( ++k <= order );
Chris@69 58 } else if( lz > 2 ) {
Chris@69 59 /* Shift to the left */
Chris@69 60 lz -= 2;
Chris@69 61 do {
Chris@69 62 C[ k ][ 0 ] = C[ k ][ 1 ] = silk_LSHIFT( c[ k ], lz );
Chris@69 63 } while( ++k <= order );
Chris@69 64 } else {
Chris@69 65 /* No need to shift */
Chris@69 66 do {
Chris@69 67 C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ];
Chris@69 68 } while( ++k <= order );
Chris@69 69 }
Chris@69 70
Chris@69 71 for( k = 0; k < order; k++ ) {
Chris@69 72 /* Check that we won't be getting an unstable rc, otherwise stop here. */
Chris@69 73 if (silk_abs_int32(C[ k + 1 ][ 0 ]) >= C[ 0 ][ 1 ]) {
Chris@69 74 if ( C[ k + 1 ][ 0 ] > 0 ) {
Chris@69 75 rc_Q15[ k ] = -SILK_FIX_CONST( .99f, 15 );
Chris@69 76 } else {
Chris@69 77 rc_Q15[ k ] = SILK_FIX_CONST( .99f, 15 );
Chris@69 78 }
Chris@69 79 k++;
Chris@69 80 break;
Chris@69 81 }
Chris@69 82
Chris@69 83 /* Get reflection coefficient */
Chris@69 84 rc_tmp_Q15 = -silk_DIV32_16( C[ k + 1 ][ 0 ], silk_max_32( silk_RSHIFT( C[ 0 ][ 1 ], 15 ), 1 ) );
Chris@69 85
Chris@69 86 /* Clip (shouldn't happen for properly conditioned inputs) */
Chris@69 87 rc_tmp_Q15 = silk_SAT16( rc_tmp_Q15 );
Chris@69 88
Chris@69 89 /* Store */
Chris@69 90 rc_Q15[ k ] = (opus_int16)rc_tmp_Q15;
Chris@69 91
Chris@69 92 /* Update correlations */
Chris@69 93 for( n = 0; n < order - k; n++ ) {
Chris@69 94 Ctmp1 = C[ n + k + 1 ][ 0 ];
Chris@69 95 Ctmp2 = C[ n ][ 1 ];
Chris@69 96 C[ n + k + 1 ][ 0 ] = silk_SMLAWB( Ctmp1, silk_LSHIFT( Ctmp2, 1 ), rc_tmp_Q15 );
Chris@69 97 C[ n ][ 1 ] = silk_SMLAWB( Ctmp2, silk_LSHIFT( Ctmp1, 1 ), rc_tmp_Q15 );
Chris@69 98 }
Chris@69 99 }
Chris@69 100
Chris@69 101 for(; k < order; k++ ) {
Chris@69 102 rc_Q15[ k ] = 0;
Chris@69 103 }
Chris@69 104
Chris@69 105 /* return residual energy */
Chris@69 106 return silk_max_32( 1, C[ 0 ][ 1 ] );
Chris@69 107 }