diff options
Diffstat (limited to 'lib/rbcodec/codecs/libopus/silk/NLSF_VQ_weights_laroia.c')
-rw-r--r-- | lib/rbcodec/codecs/libopus/silk/NLSF_VQ_weights_laroia.c | 80 |
1 files changed, 80 insertions, 0 deletions
diff --git a/lib/rbcodec/codecs/libopus/silk/NLSF_VQ_weights_laroia.c b/lib/rbcodec/codecs/libopus/silk/NLSF_VQ_weights_laroia.c new file mode 100644 index 0000000000..a89d6405ac --- /dev/null +++ b/lib/rbcodec/codecs/libopus/silk/NLSF_VQ_weights_laroia.c | |||
@@ -0,0 +1,80 @@ | |||
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 "opus_config.h" | ||
30 | #endif | ||
31 | |||
32 | #include "define.h" | ||
33 | #include "SigProc_FIX.h" | ||
34 | |||
35 | /* | ||
36 | R. Laroia, N. Phamdo and N. Farvardin, "Robust and Efficient Quantization of Speech LSP | ||
37 | Parameters Using Structured Vector Quantization", Proc. IEEE Int. Conf. Acoust., Speech, | ||
38 | Signal Processing, pp. 641-644, 1991. | ||
39 | */ | ||
40 | |||
41 | /* Laroia low complexity NLSF weights */ | ||
42 | void silk_NLSF_VQ_weights_laroia( | ||
43 | opus_int16 *pNLSFW_Q_OUT, /* O Pointer to input vector weights [D] */ | ||
44 | const opus_int16 *pNLSF_Q15, /* I Pointer to input vector [D] */ | ||
45 | const opus_int D /* I Input vector dimension (even) */ | ||
46 | ) | ||
47 | { | ||
48 | opus_int k; | ||
49 | opus_int32 tmp1_int, tmp2_int; | ||
50 | |||
51 | silk_assert( D > 0 ); | ||
52 | silk_assert( ( D & 1 ) == 0 ); | ||
53 | |||
54 | /* First value */ | ||
55 | tmp1_int = silk_max_int( pNLSF_Q15[ 0 ], 1 ); | ||
56 | tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int ); | ||
57 | tmp2_int = silk_max_int( pNLSF_Q15[ 1 ] - pNLSF_Q15[ 0 ], 1 ); | ||
58 | tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int ); | ||
59 | pNLSFW_Q_OUT[ 0 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); | ||
60 | silk_assert( pNLSFW_Q_OUT[ 0 ] > 0 ); | ||
61 | |||
62 | /* Main loop */ | ||
63 | for( k = 1; k < D - 1; k += 2 ) { | ||
64 | tmp1_int = silk_max_int( pNLSF_Q15[ k + 1 ] - pNLSF_Q15[ k ], 1 ); | ||
65 | tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int ); | ||
66 | pNLSFW_Q_OUT[ k ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); | ||
67 | silk_assert( pNLSFW_Q_OUT[ k ] > 0 ); | ||
68 | |||
69 | tmp2_int = silk_max_int( pNLSF_Q15[ k + 2 ] - pNLSF_Q15[ k + 1 ], 1 ); | ||
70 | tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int ); | ||
71 | pNLSFW_Q_OUT[ k + 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); | ||
72 | silk_assert( pNLSFW_Q_OUT[ k + 1 ] > 0 ); | ||
73 | } | ||
74 | |||
75 | /* Last value */ | ||
76 | tmp1_int = silk_max_int( ( 1 << 15 ) - pNLSF_Q15[ D - 1 ], 1 ); | ||
77 | tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int ); | ||
78 | pNLSFW_Q_OUT[ D - 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); | ||
79 | silk_assert( pNLSFW_Q_OUT[ D - 1 ] > 0 ); | ||
80 | } | ||