blob: fe5b671d2bd611ac7cdd513ff056478646a51b96 [file] [log] [blame]
Gregory Maxwellae231142011-07-30 08:18:48 -04001/***********************************************************************
2Copyright (c) 2006-2011, Skype Limited. All rights reserved.
3Redistribution and use in source and binary forms, with or without
Jean-Marc Valinae00e602012-04-20 16:31:04 -04004modification, are permitted provided that the following conditions
5are met:
Gregory Maxwellae231142011-07-30 08:18:48 -04006- Redistributions of source code must retain the above copyright notice,
7this list of conditions and the following disclaimer.
8- Redistributions in binary form must reproduce the above copyright
9notice, this list of conditions and the following disclaimer in the
10documentation and/or other materials provided with the distribution.
Jean-Marc Valinae00e602012-04-20 16:31:04 -040011- Neither the name of Internet Society, IETF or IETF Trust, nor the
12names of specific contributors, may be used to endorse or promote
13products derived from this software without specific prior written
14permission.
15THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
16AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25POSSIBILITY OF SUCH DAMAGE.
Gregory Maxwellae231142011-07-30 08:18:48 -040026***********************************************************************/
27
Jean-Marc Valin5a484122011-08-15 10:49:53 -040028#ifdef HAVE_CONFIG_H
29#include "config.h"
30#endif
31
Jean-Marc Valin1c2f5632011-09-16 01:16:53 -070032#include "SigProc_FIX.h"
33#include "resampler_private.h"
Gregory Maxwellae231142011-07-30 08:18:48 -040034
35#define ORDER_FIR 4
36
37/* Downsample by a factor 2/3, low quality */
38void silk_resampler_down2_3(
Koen Vosacc7a6c2011-10-28 19:44:26 -040039 opus_int32 *S, /* I/O State vector [ 6 ] */
40 opus_int16 *out, /* O Output signal [ floor(2*inLen/3) ] */
41 const opus_int16 *in, /* I Input signal [ inLen ] */
42 opus_int32 inLen /* I Number of input samples */
Gregory Maxwellae231142011-07-30 08:18:48 -040043)
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 */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070050 silk_memcpy( buf, S, ORDER_FIR * sizeof( opus_int32 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040051
52 /* Iterate over blocks of frameSizeIn input samples */
53 while( 1 ) {
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070054 nSamplesIn = silk_min( inLen, RESAMPLER_MAX_BATCH_SIZE_IN );
Gregory Maxwellae231142011-07-30 08:18:48 -040055
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 */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070065 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 ] );
Gregory Maxwellae231142011-07-30 08:18:48 -040069
70 /* Scale down, saturate and store in output array */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070071 *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q6, 6 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040072
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070073 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 ] );
Gregory Maxwellae231142011-07-30 08:18:48 -040077
78 /* Scale down, saturate and store in output array */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070079 *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q6, 6 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040080
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 beginning of buffer */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070090 silk_memcpy( buf, &buf[ nSamplesIn ], ORDER_FIR * sizeof( opus_int32 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040091 } else {
92 break;
93 }
94 }
95
96 /* Copy last part of filtered signal to the state for the next call */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070097 silk_memcpy( S, &buf[ nSamplesIn ], ORDER_FIR * sizeof( opus_int32 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040098}