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