cannam@154: /***********************************************************************
cannam@154: Copyright (c) 2006-2011, Skype Limited. All rights reserved.
cannam@154: Redistribution and use in source and binary forms, with or without
cannam@154: modification, are permitted provided that the following conditions
cannam@154: are met:
cannam@154: - Redistributions of source code must retain the above copyright notice,
cannam@154: this list of conditions and the following disclaimer.
cannam@154: - Redistributions in binary form must reproduce the above copyright
cannam@154: notice, this list of conditions and the following disclaimer in the
cannam@154: documentation and/or other materials provided with the distribution.
cannam@154: - Neither the name of Internet Society, IETF or IETF Trust, nor the
cannam@154: names of specific contributors, may be used to endorse or promote
cannam@154: products derived from this software without specific prior written
cannam@154: permission.
cannam@154: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
cannam@154: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
cannam@154: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
cannam@154: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
cannam@154: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
cannam@154: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
cannam@154: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
cannam@154: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
cannam@154: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
cannam@154: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
cannam@154: POSSIBILITY OF SUCH DAMAGE.
cannam@154: ***********************************************************************/
cannam@154: 
cannam@154: #ifdef HAVE_CONFIG_H
cannam@154: #include "config.h"
cannam@154: #endif
cannam@154: 
cannam@154: #include "main_FIX.h"
cannam@154: 
cannam@154: #if defined(MIPSr1_ASM)
cannam@154: #include "mips/warped_autocorrelation_FIX_mipsr1.h"
cannam@154: #endif
cannam@154: 
cannam@154: 
cannam@154: /* Autocorrelations for a warped frequency axis */
cannam@154: void silk_warped_autocorrelation_FIX_c(
cannam@154:           opus_int32                *corr,                                  /* O    Result [order + 1]                                                          */
cannam@154:           opus_int                  *scale,                                 /* O    Scaling of the correlation vector                                           */
cannam@154:     const opus_int16                *input,                                 /* I    Input data to correlate                                                     */
cannam@154:     const opus_int                  warping_Q16,                            /* I    Warping coefficient                                                         */
cannam@154:     const opus_int                  length,                                 /* I    Length of input                                                             */
cannam@154:     const opus_int                  order                                   /* I    Correlation order (even)                                                    */
cannam@154: )
cannam@154: {
cannam@154:     opus_int   n, i, lsh;
cannam@154:     opus_int32 tmp1_QS, tmp2_QS;
cannam@154:     opus_int32 state_QS[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 };
cannam@154:     opus_int64 corr_QC[  MAX_SHAPE_LPC_ORDER + 1 ] = { 0 };
cannam@154: 
cannam@154:     /* Order must be even */
cannam@154:     celt_assert( ( order & 1 ) == 0 );
cannam@154:     silk_assert( 2 * QS - QC >= 0 );
cannam@154: 
cannam@154:     /* Loop over samples */
cannam@154:     for( n = 0; n < length; n++ ) {
cannam@154:         tmp1_QS = silk_LSHIFT32( (opus_int32)input[ n ], QS );
cannam@154:         /* Loop over allpass sections */
cannam@154:         for( i = 0; i < order; i += 2 ) {
cannam@154:             /* Output of allpass section */
cannam@154:             tmp2_QS = silk_SMLAWB( state_QS[ i ], state_QS[ i + 1 ] - tmp1_QS, warping_Q16 );
cannam@154:             state_QS[ i ]  = tmp1_QS;
cannam@154:             corr_QC[  i ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
cannam@154:             /* Output of allpass section */
cannam@154:             tmp1_QS = silk_SMLAWB( state_QS[ i + 1 ], state_QS[ i + 2 ] - tmp2_QS, warping_Q16 );
cannam@154:             state_QS[ i + 1 ]  = tmp2_QS;
cannam@154:             corr_QC[  i + 1 ] += silk_RSHIFT64( silk_SMULL( tmp2_QS, state_QS[ 0 ] ), 2 * QS - QC );
cannam@154:         }
cannam@154:         state_QS[ order ] = tmp1_QS;
cannam@154:         corr_QC[  order ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
cannam@154:     }
cannam@154: 
cannam@154:     lsh = silk_CLZ64( corr_QC[ 0 ] ) - 35;
cannam@154:     lsh = silk_LIMIT( lsh, -12 - QC, 30 - QC );
cannam@154:     *scale = -( QC + lsh );
cannam@154:     silk_assert( *scale >= -30 && *scale <= 12 );
cannam@154:     if( lsh >= 0 ) {
cannam@154:         for( i = 0; i < order + 1; i++ ) {
cannam@154:             corr[ i ] = (opus_int32)silk_CHECK_FIT32( silk_LSHIFT64( corr_QC[ i ], lsh ) );
cannam@154:         }
cannam@154:     } else {
cannam@154:         for( i = 0; i < order + 1; i++ ) {
cannam@154:             corr[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( corr_QC[ i ], -lsh ) );
cannam@154:         }
cannam@154:     }
cannam@154:     silk_assert( corr_QC[ 0 ] >= 0 ); /* If breaking, decrease QC*/
cannam@154: }