cannam@154
|
1 /***********************************************************************
|
cannam@154
|
2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
cannam@154
|
3 Redistribution and use in source and binary forms, with or without
|
cannam@154
|
4 modification, are permitted provided that the following conditions
|
cannam@154
|
5 are met:
|
cannam@154
|
6 - Redistributions of source code must retain the above copyright notice,
|
cannam@154
|
7 this list of conditions and the following disclaimer.
|
cannam@154
|
8 - Redistributions in binary form must reproduce the above copyright
|
cannam@154
|
9 notice, this list of conditions and the following disclaimer in the
|
cannam@154
|
10 documentation and/or other materials provided with the distribution.
|
cannam@154
|
11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
|
cannam@154
|
12 names of specific contributors, may be used to endorse or promote
|
cannam@154
|
13 products derived from this software without specific prior written
|
cannam@154
|
14 permission.
|
cannam@154
|
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
cannam@154
|
16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
cannam@154
|
17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
cannam@154
|
18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
cannam@154
|
19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
cannam@154
|
20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
cannam@154
|
21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
cannam@154
|
22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
cannam@154
|
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
cannam@154
|
24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
cannam@154
|
25 POSSIBILITY OF SUCH DAMAGE.
|
cannam@154
|
26 ***********************************************************************/
|
cannam@154
|
27
|
cannam@154
|
28 #ifdef HAVE_CONFIG_H
|
cannam@154
|
29 #include "config.h"
|
cannam@154
|
30 #endif
|
cannam@154
|
31
|
cannam@154
|
32 #include "SigProc_FIX.h"
|
cannam@154
|
33
|
cannam@154
|
34 /* Apply sine window to signal vector. */
|
cannam@154
|
35 /* Window types: */
|
cannam@154
|
36 /* 1 -> sine window from 0 to pi/2 */
|
cannam@154
|
37 /* 2 -> sine window from pi/2 to pi */
|
cannam@154
|
38 /* Every other sample is linearly interpolated, for speed. */
|
cannam@154
|
39 /* Window length must be between 16 and 120 (incl) and a multiple of 4. */
|
cannam@154
|
40
|
cannam@154
|
41 /* Matlab code for table:
|
cannam@154
|
42 for k=16:9*4:16+2*9*4, fprintf(' %7.d,', -round(65536*pi ./ (k:4:k+8*4))); fprintf('\n'); end
|
cannam@154
|
43 */
|
cannam@154
|
44 static const opus_int16 freq_table_Q16[ 27 ] = {
|
cannam@154
|
45 12111, 9804, 8235, 7100, 6239, 5565, 5022, 4575, 4202,
|
cannam@154
|
46 3885, 3612, 3375, 3167, 2984, 2820, 2674, 2542, 2422,
|
cannam@154
|
47 2313, 2214, 2123, 2038, 1961, 1889, 1822, 1760, 1702,
|
cannam@154
|
48 };
|
cannam@154
|
49
|
cannam@154
|
50 void silk_apply_sine_window(
|
cannam@154
|
51 opus_int16 px_win[], /* O Pointer to windowed signal */
|
cannam@154
|
52 const opus_int16 px[], /* I Pointer to input signal */
|
cannam@154
|
53 const opus_int win_type, /* I Selects a window type */
|
cannam@154
|
54 const opus_int length /* I Window length, multiple of 4 */
|
cannam@154
|
55 )
|
cannam@154
|
56 {
|
cannam@154
|
57 opus_int k, f_Q16, c_Q16;
|
cannam@154
|
58 opus_int32 S0_Q16, S1_Q16;
|
cannam@154
|
59
|
cannam@154
|
60 celt_assert( win_type == 1 || win_type == 2 );
|
cannam@154
|
61
|
cannam@154
|
62 /* Length must be in a range from 16 to 120 and a multiple of 4 */
|
cannam@154
|
63 celt_assert( length >= 16 && length <= 120 );
|
cannam@154
|
64 celt_assert( ( length & 3 ) == 0 );
|
cannam@154
|
65
|
cannam@154
|
66 /* Frequency */
|
cannam@154
|
67 k = ( length >> 2 ) - 4;
|
cannam@154
|
68 celt_assert( k >= 0 && k <= 26 );
|
cannam@154
|
69 f_Q16 = (opus_int)freq_table_Q16[ k ];
|
cannam@154
|
70
|
cannam@154
|
71 /* Factor used for cosine approximation */
|
cannam@154
|
72 c_Q16 = silk_SMULWB( (opus_int32)f_Q16, -f_Q16 );
|
cannam@154
|
73 silk_assert( c_Q16 >= -32768 );
|
cannam@154
|
74
|
cannam@154
|
75 /* initialize state */
|
cannam@154
|
76 if( win_type == 1 ) {
|
cannam@154
|
77 /* start from 0 */
|
cannam@154
|
78 S0_Q16 = 0;
|
cannam@154
|
79 /* approximation of sin(f) */
|
cannam@154
|
80 S1_Q16 = f_Q16 + silk_RSHIFT( length, 3 );
|
cannam@154
|
81 } else {
|
cannam@154
|
82 /* start from 1 */
|
cannam@154
|
83 S0_Q16 = ( (opus_int32)1 << 16 );
|
cannam@154
|
84 /* approximation of cos(f) */
|
cannam@154
|
85 S1_Q16 = ( (opus_int32)1 << 16 ) + silk_RSHIFT( c_Q16, 1 ) + silk_RSHIFT( length, 4 );
|
cannam@154
|
86 }
|
cannam@154
|
87
|
cannam@154
|
88 /* Uses the recursive equation: sin(n*f) = 2 * cos(f) * sin((n-1)*f) - sin((n-2)*f) */
|
cannam@154
|
89 /* 4 samples at a time */
|
cannam@154
|
90 for( k = 0; k < length; k += 4 ) {
|
cannam@154
|
91 px_win[ k ] = (opus_int16)silk_SMULWB( silk_RSHIFT( S0_Q16 + S1_Q16, 1 ), px[ k ] );
|
cannam@154
|
92 px_win[ k + 1 ] = (opus_int16)silk_SMULWB( S1_Q16, px[ k + 1] );
|
cannam@154
|
93 S0_Q16 = silk_SMULWB( S1_Q16, c_Q16 ) + silk_LSHIFT( S1_Q16, 1 ) - S0_Q16 + 1;
|
cannam@154
|
94 S0_Q16 = silk_min( S0_Q16, ( (opus_int32)1 << 16 ) );
|
cannam@154
|
95
|
cannam@154
|
96 px_win[ k + 2 ] = (opus_int16)silk_SMULWB( silk_RSHIFT( S0_Q16 + S1_Q16, 1 ), px[ k + 2] );
|
cannam@154
|
97 px_win[ k + 3 ] = (opus_int16)silk_SMULWB( S0_Q16, px[ k + 3 ] );
|
cannam@154
|
98 S1_Q16 = silk_SMULWB( S0_Q16, c_Q16 ) + silk_LSHIFT( S0_Q16, 1 ) - S1_Q16;
|
cannam@154
|
99 S1_Q16 = silk_min( S1_Q16, ( (opus_int32)1 << 16 ) );
|
cannam@154
|
100 }
|
cannam@154
|
101 }
|