michael@0: /*********************************************************************** michael@0: Copyright (c) 2006-2011, Skype Limited. All rights reserved. michael@0: Redistribution and use in source and binary forms, with or without michael@0: modification, are permitted provided that the following conditions michael@0: are met: michael@0: - Redistributions of source code must retain the above copyright notice, michael@0: this list of conditions and the following disclaimer. michael@0: - Redistributions in binary form must reproduce the above copyright michael@0: notice, this list of conditions and the following disclaimer in the michael@0: documentation and/or other materials provided with the distribution. michael@0: - Neither the name of Internet Society, IETF or IETF Trust, nor the michael@0: names of specific contributors, may be used to endorse or promote michael@0: products derived from this software without specific prior written michael@0: permission. michael@0: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" michael@0: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE michael@0: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE michael@0: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE michael@0: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR michael@0: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF michael@0: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS michael@0: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN michael@0: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) michael@0: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE michael@0: POSSIBILITY OF SUCH DAMAGE. michael@0: ***********************************************************************/ michael@0: michael@0: #ifdef HAVE_CONFIG_H michael@0: #include "config.h" michael@0: #endif michael@0: michael@0: #include "SigProc_FIX.h" michael@0: #include "resampler_private.h" michael@0: #include "stack_alloc.h" michael@0: michael@0: static OPUS_INLINE opus_int16 *silk_resampler_private_IIR_FIR_INTERPOL( michael@0: opus_int16 *out, michael@0: opus_int16 *buf, michael@0: opus_int32 max_index_Q16, michael@0: opus_int32 index_increment_Q16 michael@0: ) michael@0: { michael@0: opus_int32 index_Q16, res_Q15; michael@0: opus_int16 *buf_ptr; michael@0: opus_int32 table_index; michael@0: michael@0: /* Interpolate upsampled signal and store in output array */ michael@0: for( index_Q16 = 0; index_Q16 < max_index_Q16; index_Q16 += index_increment_Q16 ) { michael@0: table_index = silk_SMULWB( index_Q16 & 0xFFFF, 12 ); michael@0: buf_ptr = &buf[ index_Q16 >> 16 ]; michael@0: michael@0: res_Q15 = silk_SMULBB( buf_ptr[ 0 ], silk_resampler_frac_FIR_12[ table_index ][ 0 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 1 ], silk_resampler_frac_FIR_12[ table_index ][ 1 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 2 ], silk_resampler_frac_FIR_12[ table_index ][ 2 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 3 ], silk_resampler_frac_FIR_12[ table_index ][ 3 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 4 ], silk_resampler_frac_FIR_12[ 11 - table_index ][ 3 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 5 ], silk_resampler_frac_FIR_12[ 11 - table_index ][ 2 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 6 ], silk_resampler_frac_FIR_12[ 11 - table_index ][ 1 ] ); michael@0: res_Q15 = silk_SMLABB( res_Q15, buf_ptr[ 7 ], silk_resampler_frac_FIR_12[ 11 - table_index ][ 0 ] ); michael@0: *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q15, 15 ) ); michael@0: } michael@0: return out; michael@0: } michael@0: /* Upsample using a combination of allpass-based 2x upsampling and FIR interpolation */ michael@0: void silk_resampler_private_IIR_FIR( michael@0: void *SS, /* I/O Resampler state */ michael@0: opus_int16 out[], /* O Output signal */ michael@0: const opus_int16 in[], /* I Input signal */ michael@0: opus_int32 inLen /* I Number of input samples */ michael@0: ) michael@0: { michael@0: silk_resampler_state_struct *S = (silk_resampler_state_struct *)SS; michael@0: opus_int32 nSamplesIn; michael@0: opus_int32 max_index_Q16, index_increment_Q16; michael@0: VARDECL( opus_int16, buf ); michael@0: SAVE_STACK; michael@0: michael@0: ALLOC( buf, 2 * S->batchSize + RESAMPLER_ORDER_FIR_12, opus_int16 ); michael@0: michael@0: /* Copy buffered samples to start of buffer */ michael@0: silk_memcpy( buf, S->sFIR.i16, RESAMPLER_ORDER_FIR_12 * sizeof( opus_int16 ) ); michael@0: michael@0: /* Iterate over blocks of frameSizeIn input samples */ michael@0: index_increment_Q16 = S->invRatio_Q16; michael@0: while( 1 ) { michael@0: nSamplesIn = silk_min( inLen, S->batchSize ); michael@0: michael@0: /* Upsample 2x */ michael@0: silk_resampler_private_up2_HQ( S->sIIR, &buf[ RESAMPLER_ORDER_FIR_12 ], in, nSamplesIn ); michael@0: michael@0: max_index_Q16 = silk_LSHIFT32( nSamplesIn, 16 + 1 ); /* + 1 because 2x upsampling */ michael@0: out = silk_resampler_private_IIR_FIR_INTERPOL( out, buf, max_index_Q16, index_increment_Q16 ); michael@0: in += nSamplesIn; michael@0: inLen -= nSamplesIn; michael@0: michael@0: if( inLen > 0 ) { michael@0: /* More iterations to do; copy last part of filtered signal to beginning of buffer */ michael@0: silk_memcpy( buf, &buf[ nSamplesIn << 1 ], RESAMPLER_ORDER_FIR_12 * sizeof( opus_int16 ) ); michael@0: } else { michael@0: break; michael@0: } michael@0: } michael@0: michael@0: /* Copy last part of filtered signal to the state for the next call */ michael@0: silk_memcpy( S->sFIR.i16, &buf[ nSamplesIn << 1 ], RESAMPLER_ORDER_FIR_12 * sizeof( opus_int16 ) ); michael@0: RESTORE_STACK; michael@0: }