blob: 4342614dcccc11348bf9e45c4e20691e19f69982 [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.
Ralph Gilesf2446c22013-09-16 14:40:04 -070011- Neither the name of Internet Society, IETF or IETF Trust, nor the
Jean-Marc Valinae00e602012-04-20 16:31:04 -040012names of specific contributors, may be used to endorse or promote
13products derived from this software without specific prior written
14permission.
Timothy B. Terriberry80ad3832013-05-19 18:00:39 -070015THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
Jean-Marc Valinae00e602012-04-20 16:31:04 -040016AND 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"
Timothy B. Terriberryc152d602013-05-08 10:32:37 -070034#include "stack_alloc.h"
Gregory Maxwellae231142011-07-30 08:18:48 -040035
36#define ORDER_FIR 4
37
38/* Downsample by a factor 2/3, low quality */
39void silk_resampler_down2_3(
Koen Vosacc7a6c2011-10-28 19:44:26 -040040 opus_int32 *S, /* I/O State vector [ 6 ] */
41 opus_int16 *out, /* O Output signal [ floor(2*inLen/3) ] */
42 const opus_int16 *in, /* I Input signal [ inLen ] */
43 opus_int32 inLen /* I Number of input samples */
Gregory Maxwellae231142011-07-30 08:18:48 -040044)
45{
46 opus_int32 nSamplesIn, counter, res_Q6;
Timothy B. Terriberryc152d602013-05-08 10:32:37 -070047 VARDECL( opus_int32, buf );
Gregory Maxwellae231142011-07-30 08:18:48 -040048 opus_int32 *buf_ptr;
Timothy B. Terriberryc152d602013-05-08 10:32:37 -070049 SAVE_STACK;
50
51 ALLOC( buf, RESAMPLER_MAX_BATCH_SIZE_IN + ORDER_FIR, opus_int32 );
Gregory Maxwellae231142011-07-30 08:18:48 -040052
53 /* Copy buffered samples to start of buffer */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070054 silk_memcpy( buf, S, ORDER_FIR * sizeof( opus_int32 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040055
56 /* Iterate over blocks of frameSizeIn input samples */
57 while( 1 ) {
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070058 nSamplesIn = silk_min( inLen, RESAMPLER_MAX_BATCH_SIZE_IN );
Gregory Maxwellae231142011-07-30 08:18:48 -040059
60 /* Second-order AR filter (output in Q8) */
61 silk_resampler_private_AR2( &S[ ORDER_FIR ], &buf[ ORDER_FIR ], in,
62 silk_Resampler_2_3_COEFS_LQ, nSamplesIn );
63
64 /* Interpolate filtered signal */
65 buf_ptr = buf;
66 counter = nSamplesIn;
67 while( counter > 2 ) {
68 /* Inner product */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070069 res_Q6 = silk_SMULWB( buf_ptr[ 0 ], silk_Resampler_2_3_COEFS_LQ[ 2 ] );
70 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 1 ], silk_Resampler_2_3_COEFS_LQ[ 3 ] );
71 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 2 ], silk_Resampler_2_3_COEFS_LQ[ 5 ] );
72 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 3 ], silk_Resampler_2_3_COEFS_LQ[ 4 ] );
Gregory Maxwellae231142011-07-30 08:18:48 -040073
74 /* Scale down, saturate and store in output array */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070075 *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q6, 6 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040076
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070077 res_Q6 = silk_SMULWB( buf_ptr[ 1 ], silk_Resampler_2_3_COEFS_LQ[ 4 ] );
78 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 2 ], silk_Resampler_2_3_COEFS_LQ[ 5 ] );
79 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 3 ], silk_Resampler_2_3_COEFS_LQ[ 3 ] );
80 res_Q6 = silk_SMLAWB( res_Q6, buf_ptr[ 4 ], silk_Resampler_2_3_COEFS_LQ[ 2 ] );
Gregory Maxwellae231142011-07-30 08:18:48 -040081
82 /* Scale down, saturate and store in output array */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070083 *out++ = (opus_int16)silk_SAT16( silk_RSHIFT_ROUND( res_Q6, 6 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040084
85 buf_ptr += 3;
86 counter -= 3;
87 }
88
89 in += nSamplesIn;
90 inLen -= nSamplesIn;
91
92 if( inLen > 0 ) {
93 /* More iterations to do; copy last part of filtered signal to beginning of buffer */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070094 silk_memcpy( buf, &buf[ nSamplesIn ], ORDER_FIR * sizeof( opus_int32 ) );
Gregory Maxwellae231142011-07-30 08:18:48 -040095 } else {
96 break;
97 }
98 }
99
100 /* Copy last part of filtered signal to the state for the next call */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -0700101 silk_memcpy( S, &buf[ nSamplesIn ], ORDER_FIR * sizeof( opus_int32 ) );
Timothy B. Terriberryc152d602013-05-08 10:32:37 -0700102 RESTORE_STACK;
Gregory Maxwellae231142011-07-30 08:18:48 -0400103}