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: michael@0: /* Upsample by a factor 2, high quality */ michael@0: /* Uses 2nd order allpass filters for the 2x upsampling, followed by a */ michael@0: /* notch filter just above Nyquist. */ michael@0: void silk_resampler_private_up2_HQ( michael@0: opus_int32 *S, /* I/O Resampler state [ 6 ] */ michael@0: opus_int16 *out, /* O Output signal [ 2 * len ] */ michael@0: const opus_int16 *in, /* I Input signal [ len ] */ michael@0: opus_int32 len /* I Number of input samples */ michael@0: ) michael@0: { michael@0: opus_int32 k; michael@0: opus_int32 in32, out32_1, out32_2, Y, X; michael@0: michael@0: silk_assert( silk_resampler_up2_hq_0[ 0 ] > 0 ); michael@0: silk_assert( silk_resampler_up2_hq_0[ 1 ] > 0 ); michael@0: silk_assert( silk_resampler_up2_hq_0[ 2 ] < 0 ); michael@0: silk_assert( silk_resampler_up2_hq_1[ 0 ] > 0 ); michael@0: silk_assert( silk_resampler_up2_hq_1[ 1 ] > 0 ); michael@0: silk_assert( silk_resampler_up2_hq_1[ 2 ] < 0 ); michael@0: michael@0: /* Internal variables and state are in Q10 format */ michael@0: for( k = 0; k < len; k++ ) { michael@0: /* Convert to Q10 */ michael@0: in32 = silk_LSHIFT( (opus_int32)in[ k ], 10 ); michael@0: michael@0: /* First all-pass section for even output sample */ michael@0: Y = silk_SUB32( in32, S[ 0 ] ); michael@0: X = silk_SMULWB( Y, silk_resampler_up2_hq_0[ 0 ] ); michael@0: out32_1 = silk_ADD32( S[ 0 ], X ); michael@0: S[ 0 ] = silk_ADD32( in32, X ); michael@0: michael@0: /* Second all-pass section for even output sample */ michael@0: Y = silk_SUB32( out32_1, S[ 1 ] ); michael@0: X = silk_SMULWB( Y, silk_resampler_up2_hq_0[ 1 ] ); michael@0: out32_2 = silk_ADD32( S[ 1 ], X ); michael@0: S[ 1 ] = silk_ADD32( out32_1, X ); michael@0: michael@0: /* Third all-pass section for even output sample */ michael@0: Y = silk_SUB32( out32_2, S[ 2 ] ); michael@0: X = silk_SMLAWB( Y, Y, silk_resampler_up2_hq_0[ 2 ] ); michael@0: out32_1 = silk_ADD32( S[ 2 ], X ); michael@0: S[ 2 ] = silk_ADD32( out32_2, X ); michael@0: michael@0: /* Apply gain in Q15, convert back to int16 and store to output */ michael@0: out[ 2 * k ] = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( out32_1, 10 ) ); michael@0: michael@0: /* First all-pass section for odd output sample */ michael@0: Y = silk_SUB32( in32, S[ 3 ] ); michael@0: X = silk_SMULWB( Y, silk_resampler_up2_hq_1[ 0 ] ); michael@0: out32_1 = silk_ADD32( S[ 3 ], X ); michael@0: S[ 3 ] = silk_ADD32( in32, X ); michael@0: michael@0: /* Second all-pass section for odd output sample */ michael@0: Y = silk_SUB32( out32_1, S[ 4 ] ); michael@0: X = silk_SMULWB( Y, silk_resampler_up2_hq_1[ 1 ] ); michael@0: out32_2 = silk_ADD32( S[ 4 ], X ); michael@0: S[ 4 ] = silk_ADD32( out32_1, X ); michael@0: michael@0: /* Third all-pass section for odd output sample */ michael@0: Y = silk_SUB32( out32_2, S[ 5 ] ); michael@0: X = silk_SMLAWB( Y, Y, silk_resampler_up2_hq_1[ 2 ] ); michael@0: out32_1 = silk_ADD32( S[ 5 ], X ); michael@0: S[ 5 ] = silk_ADD32( out32_2, X ); michael@0: michael@0: /* Apply gain in Q15, convert back to int16 and store to output */ michael@0: out[ 2 * k + 1 ] = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( out32_1, 10 ) ); michael@0: } michael@0: } michael@0: michael@0: void silk_resampler_private_up2_HQ_wrapper( michael@0: void *SS, /* I/O Resampler state (unused) */ michael@0: opus_int16 *out, /* O Output signal [ 2 * len ] */ michael@0: const opus_int16 *in, /* I Input signal [ len ] */ michael@0: opus_int32 len /* I Number of input samples */ michael@0: ) michael@0: { michael@0: silk_resampler_state_struct *S = (silk_resampler_state_struct *)SS; michael@0: silk_resampler_private_up2_HQ( S->sIIR, out, in, len ); michael@0: }