annotate src/opus-1.3/silk/resampler_down2_3.c @ 81:7029a4916348

Merge build update
author Chris Cannam
date Thu, 31 Oct 2019 13:36:58 +0000
parents 7aeed7906520
children
rev   line source
Chris@69 1 /***********************************************************************
Chris@69 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
Chris@69 3 Redistribution and use in source and binary forms, with or without
Chris@69 4 modification, are permitted provided that the following conditions
Chris@69 5 are met:
Chris@69 6 - Redistributions of source code must retain the above copyright notice,
Chris@69 7 this list of conditions and the following disclaimer.
Chris@69 8 - Redistributions in binary form must reproduce the above copyright
Chris@69 9 notice, this list of conditions and the following disclaimer in the
Chris@69 10 documentation and/or other materials provided with the distribution.
Chris@69 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
Chris@69 12 names of specific contributors, may be used to endorse or promote
Chris@69 13 products derived from this software without specific prior written
Chris@69 14 permission.
Chris@69 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
Chris@69 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
Chris@69 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
Chris@69 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
Chris@69 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
Chris@69 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
Chris@69 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
Chris@69 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
Chris@69 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
Chris@69 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Chris@69 25 POSSIBILITY OF SUCH DAMAGE.
Chris@69 26 ***********************************************************************/
Chris@69 27
Chris@69 28 #ifdef HAVE_CONFIG_H
Chris@69 29 #include "config.h"
Chris@69 30 #endif
Chris@69 31
Chris@69 32 #include "SigProc_FIX.h"
Chris@69 33 #include "resampler_private.h"
Chris@69 34 #include "stack_alloc.h"
Chris@69 35
Chris@69 36 #define ORDER_FIR 4
Chris@69 37
Chris@69 38 /* Downsample by a factor 2/3, low quality */
Chris@69 39 void silk_resampler_down2_3(
Chris@69 40 opus_int32 *S, /* I/O State vector [ 6 ] */
Chris@69 41 opus_int16 *out, /* O Output signal [ floor(2*inLen/3) ] */
Chris@69 42 const opus_int16 *in, /* I Input signal [ inLen ] */
Chris@69 43 opus_int32 inLen /* I Number of input samples */
Chris@69 44 )
Chris@69 45 {
Chris@69 46 opus_int32 nSamplesIn, counter, res_Q6;
Chris@69 47 VARDECL( opus_int32, buf );
Chris@69 48 opus_int32 *buf_ptr;
Chris@69 49 SAVE_STACK;
Chris@69 50
Chris@69 51 ALLOC( buf, RESAMPLER_MAX_BATCH_SIZE_IN + ORDER_FIR, opus_int32 );
Chris@69 52
Chris@69 53 /* Copy buffered samples to start of buffer */
Chris@69 54 silk_memcpy( buf, S, ORDER_FIR * sizeof( opus_int32 ) );
Chris@69 55
Chris@69 56 /* Iterate over blocks of frameSizeIn input samples */
Chris@69 57 while( 1 ) {
Chris@69 58 nSamplesIn = silk_min( inLen, RESAMPLER_MAX_BATCH_SIZE_IN );
Chris@69 59
Chris@69 60 /* Second-order AR filter (output in Q8) */
Chris@69 61 silk_resampler_private_AR2( &S[ ORDER_FIR ], &buf[ ORDER_FIR ], in,
Chris@69 62 silk_Resampler_2_3_COEFS_LQ, nSamplesIn );
Chris@69 63
Chris@69 64 /* Interpolate filtered signal */
Chris@69 65 buf_ptr = buf;
Chris@69 66 counter = nSamplesIn;
Chris@69 67 while( counter > 2 ) {
Chris@69 68 /* Inner product */
Chris@69 69 res_Q6 = silk_SMULWB( buf_ptr[ 0 ], silk_Resampler_2_3_COEFS_LQ[ 2 ] );
Chris@69 70 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 1 ], silk_Resampler_2_3_COEFS_LQ[ 3 ] );
Chris@69 71 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 2 ], silk_Resampler_2_3_COEFS_LQ[ 5 ] );
Chris@69 72 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 3 ], silk_Resampler_2_3_COEFS_LQ[ 4 ] );
Chris@69 73
Chris@69 74 /* Scale down, saturate and store in output array */
Chris@69 75 *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q6, 6 ) );
Chris@69 76
Chris@69 77 res_Q6 = silk_SMULWB( buf_ptr[ 1 ], silk_Resampler_2_3_COEFS_LQ[ 4 ] );
Chris@69 78 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 2 ], silk_Resampler_2_3_COEFS_LQ[ 5 ] );
Chris@69 79 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 3 ], silk_Resampler_2_3_COEFS_LQ[ 3 ] );
Chris@69 80 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 4 ], silk_Resampler_2_3_COEFS_LQ[ 2 ] );
Chris@69 81
Chris@69 82 /* Scale down, saturate and store in output array */
Chris@69 83 *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q6, 6 ) );
Chris@69 84
Chris@69 85 buf_ptr += 3;
Chris@69 86 counter -= 3;
Chris@69 87 }
Chris@69 88
Chris@69 89 in += nSamplesIn;
Chris@69 90 inLen -= nSamplesIn;
Chris@69 91
Chris@69 92 if( inLen > 0 ) {
Chris@69 93 /* More iterations to do; copy last part of filtered signal to beginning of buffer */
Chris@69 94 silk_memcpy( buf, &buf[ nSamplesIn ], ORDER_FIR * sizeof( opus_int32 ) );
Chris@69 95 } else {
Chris@69 96 break;
Chris@69 97 }
Chris@69 98 }
Chris@69 99
Chris@69 100 /* Copy last part of filtered signal to the state for the next call */
Chris@69 101 silk_memcpy( S, &buf[ nSamplesIn ], ORDER_FIR * sizeof( opus_int32 ) );
Chris@69 102 RESTORE_STACK;
Chris@69 103 }