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 "define.h"
|
cannam@154
|
33 #include "SigProc_FIX.h"
|
cannam@154
|
34
|
cannam@154
|
35 /*
|
cannam@154
|
36 R. Laroia, N. Phamdo and N. Farvardin, "Robust and Efficient Quantization of Speech LSP
|
cannam@154
|
37 Parameters Using Structured Vector Quantization", Proc. IEEE Int. Conf. Acoust., Speech,
|
cannam@154
|
38 Signal Processing, pp. 641-644, 1991.
|
cannam@154
|
39 */
|
cannam@154
|
40
|
cannam@154
|
41 /* Laroia low complexity NLSF weights */
|
cannam@154
|
42 void silk_NLSF_VQ_weights_laroia(
|
cannam@154
|
43 opus_int16 *pNLSFW_Q_OUT, /* O Pointer to input vector weights [D] */
|
cannam@154
|
44 const opus_int16 *pNLSF_Q15, /* I Pointer to input vector [D] */
|
cannam@154
|
45 const opus_int D /* I Input vector dimension (even) */
|
cannam@154
|
46 )
|
cannam@154
|
47 {
|
cannam@154
|
48 opus_int k;
|
cannam@154
|
49 opus_int32 tmp1_int, tmp2_int;
|
cannam@154
|
50
|
cannam@154
|
51 celt_assert( D > 0 );
|
cannam@154
|
52 celt_assert( ( D & 1 ) == 0 );
|
cannam@154
|
53
|
cannam@154
|
54 /* First value */
|
cannam@154
|
55 tmp1_int = silk_max_int( pNLSF_Q15[ 0 ], 1 );
|
cannam@154
|
56 tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int );
|
cannam@154
|
57 tmp2_int = silk_max_int( pNLSF_Q15[ 1 ] - pNLSF_Q15[ 0 ], 1 );
|
cannam@154
|
58 tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int );
|
cannam@154
|
59 pNLSFW_Q_OUT[ 0 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
|
cannam@154
|
60 silk_assert( pNLSFW_Q_OUT[ 0 ] > 0 );
|
cannam@154
|
61
|
cannam@154
|
62 /* Main loop */
|
cannam@154
|
63 for( k = 1; k < D - 1; k += 2 ) {
|
cannam@154
|
64 tmp1_int = silk_max_int( pNLSF_Q15[ k + 1 ] - pNLSF_Q15[ k ], 1 );
|
cannam@154
|
65 tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int );
|
cannam@154
|
66 pNLSFW_Q_OUT[ k ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
|
cannam@154
|
67 silk_assert( pNLSFW_Q_OUT[ k ] > 0 );
|
cannam@154
|
68
|
cannam@154
|
69 tmp2_int = silk_max_int( pNLSF_Q15[ k + 2 ] - pNLSF_Q15[ k + 1 ], 1 );
|
cannam@154
|
70 tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int );
|
cannam@154
|
71 pNLSFW_Q_OUT[ k + 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
|
cannam@154
|
72 silk_assert( pNLSFW_Q_OUT[ k + 1 ] > 0 );
|
cannam@154
|
73 }
|
cannam@154
|
74
|
cannam@154
|
75 /* Last value */
|
cannam@154
|
76 tmp1_int = silk_max_int( ( 1 << 15 ) - pNLSF_Q15[ D - 1 ], 1 );
|
cannam@154
|
77 tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int );
|
cannam@154
|
78 pNLSFW_Q_OUT[ D - 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
|
cannam@154
|
79 silk_assert( pNLSFW_Q_OUT[ D - 1 ] > 0 );
|
cannam@154
|
80 }
|