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