87 lines
4.3 KiB
C
87 lines
4.3 KiB
C
/***********************************************************************
|
|
Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, (subject to the limitations in the disclaimer below)
|
|
are permitted provided that the following conditions are met:
|
|
- Redistributions of source code must retain the above copyright notice,
|
|
this list of conditions and the following disclaimer.
|
|
- Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
- Neither the name of Skype Limited, nor the names of specific
|
|
contributors, may be used to endorse or promote products derived from
|
|
this software without specific prior written permission.
|
|
NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED
|
|
BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
|
CONTRIBUTORS ''AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
|
|
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
|
USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
***********************************************************************/
|
|
|
|
#include "SKP_Silk_main_FIX.h"
|
|
|
|
#define QC 10
|
|
#define QS 14
|
|
|
|
|
|
/* Autocorrelations for a warped frequency axis */
|
|
void SKP_Silk_warped_autocorrelation_FIX(
|
|
SKP_int32 *corr, /* O Result [order + 1] */
|
|
SKP_int *scale, /* O Scaling of the correlation vector */
|
|
const SKP_int16 *input, /* I Input data to correlate */
|
|
const SKP_int16 warping_Q16, /* I Warping coefficient */
|
|
const SKP_int length, /* I Length of input */
|
|
const SKP_int order /* I Correlation order (even) */
|
|
)
|
|
{
|
|
SKP_int n, i, lsh;
|
|
SKP_int32 tmp1_QS, tmp2_QS;
|
|
SKP_int32 state_QS[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 };
|
|
SKP_int64 corr_QC[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 };
|
|
|
|
/* Order must be even */
|
|
SKP_assert( ( order & 1 ) == 0 );
|
|
SKP_assert( 2 * QS - QC >= 0 );
|
|
|
|
/* Loop over samples */
|
|
for( n = 0; n < length; n++ ) {
|
|
tmp1_QS = SKP_LSHIFT32( ( SKP_int32 )input[ n ], QS );
|
|
/* Loop over allpass sections */
|
|
for( i = 0; i < order; i += 2 ) {
|
|
/* Output of allpass section */
|
|
tmp2_QS = SKP_SMLAWB( state_QS[ i ], state_QS[ i + 1 ] - tmp1_QS, warping_Q16 );
|
|
state_QS[ i ] = tmp1_QS;
|
|
corr_QC[ i ] += SKP_RSHIFT64( SKP_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
|
|
/* Output of allpass section */
|
|
tmp1_QS = SKP_SMLAWB( state_QS[ i + 1 ], state_QS[ i + 2 ] - tmp2_QS, warping_Q16 );
|
|
state_QS[ i + 1 ] = tmp2_QS;
|
|
corr_QC[ i + 1 ] += SKP_RSHIFT64( SKP_SMULL( tmp2_QS, state_QS[ 0 ] ), 2 * QS - QC );
|
|
}
|
|
state_QS[ order ] = tmp1_QS;
|
|
corr_QC[ order ] += SKP_RSHIFT64( SKP_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC );
|
|
}
|
|
|
|
lsh = SKP_Silk_CLZ64( corr_QC[ 0 ] ) - 35;
|
|
lsh = SKP_LIMIT( lsh, -12 - QC, 30 - QC );
|
|
*scale = -( QC + lsh );
|
|
SKP_assert( *scale >= -30 && *scale <= 12 );
|
|
if( lsh >= 0 ) {
|
|
for( i = 0; i < order + 1; i++ ) {
|
|
corr[ i ] = ( SKP_int32 )SKP_CHECK_FIT32( SKP_LSHIFT64( corr_QC[ i ], lsh ) );
|
|
}
|
|
} else {
|
|
for( i = 0; i < order + 1; i++ ) {
|
|
corr[ i ] = ( SKP_int32 )SKP_CHECK_FIT32( SKP_RSHIFT64( corr_QC[ i ], -lsh ) );
|
|
}
|
|
}
|
|
SKP_assert( corr_QC[ 0 ] >= 0 ); // If breaking, decrease QC
|
|
}
|
|
|