annotate src/opus-1.3/silk/fixed/schur64_FIX.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 4664ac0c1032
children
rev   line source
cannam@154 1 /***********************************************************************
cannam@154 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
cannam@154 3 Redistribution and use in source and binary forms, with or without
cannam@154 4 modification, are permitted provided that the following conditions
cannam@154 5 are met:
cannam@154 6 - Redistributions of source code must retain the above copyright notice,
cannam@154 7 this list of conditions and the following disclaimer.
cannam@154 8 - Redistributions in binary form must reproduce the above copyright
cannam@154 9 notice, this list of conditions and the following disclaimer in the
cannam@154 10 documentation and/or other materials provided with the distribution.
cannam@154 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
cannam@154 12 names of specific contributors, may be used to endorse or promote
cannam@154 13 products derived from this software without specific prior written
cannam@154 14 permission.
cannam@154 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
cannam@154 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
cannam@154 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
cannam@154 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
cannam@154 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
cannam@154 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
cannam@154 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
cannam@154 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
cannam@154 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
cannam@154 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
cannam@154 25 POSSIBILITY OF SUCH DAMAGE.
cannam@154 26 ***********************************************************************/
cannam@154 27
cannam@154 28 #ifdef HAVE_CONFIG_H
cannam@154 29 #include "config.h"
cannam@154 30 #endif
cannam@154 31
cannam@154 32 #include "SigProc_FIX.h"
cannam@154 33
cannam@154 34 /* Slower than schur(), but more accurate. */
cannam@154 35 /* Uses SMULL(), available on armv4 */
cannam@154 36 opus_int32 silk_schur64( /* O returns residual energy */
cannam@154 37 opus_int32 rc_Q16[], /* O Reflection coefficients [order] Q16 */
cannam@154 38 const opus_int32 c[], /* I Correlations [order+1] */
cannam@154 39 opus_int32 order /* I Prediction order */
cannam@154 40 )
cannam@154 41 {
cannam@154 42 opus_int k, n;
cannam@154 43 opus_int32 C[ SILK_MAX_ORDER_LPC + 1 ][ 2 ];
cannam@154 44 opus_int32 Ctmp1_Q30, Ctmp2_Q30, rc_tmp_Q31;
cannam@154 45
cannam@154 46 celt_assert( order >= 0 && order <= SILK_MAX_ORDER_LPC );
cannam@154 47
cannam@154 48 /* Check for invalid input */
cannam@154 49 if( c[ 0 ] <= 0 ) {
cannam@154 50 silk_memset( rc_Q16, 0, order * sizeof( opus_int32 ) );
cannam@154 51 return 0;
cannam@154 52 }
cannam@154 53
cannam@154 54 k = 0;
cannam@154 55 do {
cannam@154 56 C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ];
cannam@154 57 } while( ++k <= order );
cannam@154 58
cannam@154 59 for( k = 0; k < order; k++ ) {
cannam@154 60 /* Check that we won't be getting an unstable rc, otherwise stop here. */
cannam@154 61 if (silk_abs_int32(C[ k + 1 ][ 0 ]) >= C[ 0 ][ 1 ]) {
cannam@154 62 if ( C[ k + 1 ][ 0 ] > 0 ) {
cannam@154 63 rc_Q16[ k ] = -SILK_FIX_CONST( .99f, 16 );
cannam@154 64 } else {
cannam@154 65 rc_Q16[ k ] = SILK_FIX_CONST( .99f, 16 );
cannam@154 66 }
cannam@154 67 k++;
cannam@154 68 break;
cannam@154 69 }
cannam@154 70
cannam@154 71 /* Get reflection coefficient: divide two Q30 values and get result in Q31 */
cannam@154 72 rc_tmp_Q31 = silk_DIV32_varQ( -C[ k + 1 ][ 0 ], C[ 0 ][ 1 ], 31 );
cannam@154 73
cannam@154 74 /* Save the output */
cannam@154 75 rc_Q16[ k ] = silk_RSHIFT_ROUND( rc_tmp_Q31, 15 );
cannam@154 76
cannam@154 77 /* Update correlations */
cannam@154 78 for( n = 0; n < order - k; n++ ) {
cannam@154 79 Ctmp1_Q30 = C[ n + k + 1 ][ 0 ];
cannam@154 80 Ctmp2_Q30 = C[ n ][ 1 ];
cannam@154 81
cannam@154 82 /* Multiply and add the highest int32 */
cannam@154 83 C[ n + k + 1 ][ 0 ] = Ctmp1_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp2_Q30, 1 ), rc_tmp_Q31 );
cannam@154 84 C[ n ][ 1 ] = Ctmp2_Q30 + silk_SMMUL( silk_LSHIFT( Ctmp1_Q30, 1 ), rc_tmp_Q31 );
cannam@154 85 }
cannam@154 86 }
cannam@154 87
cannam@154 88 for(; k < order; k++ ) {
cannam@154 89 rc_Q16[ k ] = 0;
cannam@154 90 }
cannam@154 91
cannam@154 92 return silk_max_32( 1, C[ 0 ][ 1 ] );
cannam@154 93 }