annotate src/opus-1.3/silk/fixed/schur64_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 /* Slower than schur(), but more accurate. */
Chris@69 35 /* Uses SMULL(), available on armv4 */
Chris@69 36 opus_int32 silk_schur64( /* O returns residual energy */
Chris@69 37 opus_int32 rc_Q16[], /* O Reflection coefficients [order] Q16 */
Chris@69 38 const opus_int32 c[], /* I Correlations [order+1] */
Chris@69 39 opus_int32 order /* I Prediction order */
Chris@69 40 )
Chris@69 41 {
Chris@69 42 opus_int k, n;
Chris@69 43 opus_int32 C[ SILK_MAX_ORDER_LPC + 1 ][ 2 ];
Chris@69 44 opus_int32 Ctmp1_Q30, Ctmp2_Q30, rc_tmp_Q31;
Chris@69 45
Chris@69 46 celt_assert( order >= 0 && order <= SILK_MAX_ORDER_LPC );
Chris@69 47
Chris@69 48 /* Check for invalid input */
Chris@69 49 if( c[ 0 ] <= 0 ) {
Chris@69 50 silk_memset( rc_Q16, 0, order * sizeof( opus_int32 ) );
Chris@69 51 return 0;
Chris@69 52 }
Chris@69 53
Chris@69 54 k = 0;
Chris@69 55 do {
Chris@69 56 C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ];
Chris@69 57 } while( ++k <= order );
Chris@69 58
Chris@69 59 for( k = 0; k < order; k++ ) {
Chris@69 60 /* Check that we won't be getting an unstable rc, otherwise stop here. */
Chris@69 61 if (silk_abs_int32(C[ k + 1 ][ 0 ]) >= C[ 0 ][ 1 ]) {
Chris@69 62 if ( C[ k + 1 ][ 0 ] > 0 ) {
Chris@69 63 rc_Q16[ k ] = -SILK_FIX_CONST( .99f, 16 );
Chris@69 64 } else {
Chris@69 65 rc_Q16[ k ] = SILK_FIX_CONST( .99f, 16 );
Chris@69 66 }
Chris@69 67 k++;
Chris@69 68 break;
Chris@69 69 }
Chris@69 70
Chris@69 71 /* Get reflection coefficient: divide two Q30 values and get result in Q31 */
Chris@69 72 rc_tmp_Q31 = silk_DIV32_varQ( -C[ k + 1 ][ 0 ], C[ 0 ][ 1 ], 31 );
Chris@69 73
Chris@69 74 /* Save the output */
Chris@69 75 rc_Q16[ k ] = silk_RSHIFT_ROUND( rc_tmp_Q31, 15 );
Chris@69 76
Chris@69 77 /* Update correlations */
Chris@69 78 for( n = 0; n < order - k; n++ ) {
Chris@69 79 Ctmp1_Q30 = C[ n + k + 1 ][ 0 ];
Chris@69 80 Ctmp2_Q30 = C[ n ][ 1 ];
Chris@69 81
Chris@69 82 /* Multiply and add the highest int32 */
Chris@69 83 C[ n + k + 1 ][ 0 ] = Ctmp1_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp2_Q30, 1 ), rc_tmp_Q31 );
Chris@69 84 C[ n ][ 1 ] = Ctmp2_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp1_Q30, 1 ), rc_tmp_Q31 );
Chris@69 85 }
Chris@69 86 }
Chris@69 87
Chris@69 88 for(; k < order; k++ ) {
Chris@69 89 rc_Q16[ k ] = 0;
Chris@69 90 }
Chris@69 91
Chris@69 92 return silk_max_32( 1, C[ 0 ][ 1 ] );
Chris@69 93 }