blob: ce7a3e5dd50e2be24333edb620892c2ce6b97b40 [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
4modification, (subject to the limitations in the disclaimer below)
5are permitted provided that the following conditions are met:
6- 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.
11- Neither the name of Skype Limited, nor the names of specific
12contributors, may be used to endorse or promote products derived from
13this software without specific prior written permission.
14NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED
15BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
16CONTRIBUTORS ''AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
17BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
18FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
19COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
20INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
22USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
23ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26***********************************************************************/
27
Jean-Marc Valin5a484122011-08-15 10:49:53 -040028#ifdef HAVE_CONFIG_H
29#include "config.h"
30#endif
31
Gregory Maxwellae231142011-07-30 08:18:48 -040032#include "silk_define.h"
33#include "silk_SigProc_FIX.h"
34
35/*
36R. Laroia, N. Phamdo and N. Farvardin, "Robust and Efficient Quantization of Speech LSP
37Parameters Using Structured Vector Quantization", Proc. IEEE Int. Conf. Acoust., Speech,
38Signal Processing, pp. 641-644, 1991.
39*/
40
41/* Laroia low complexity NLSF weights */
42void silk_NLSF_VQ_weights_laroia(
43 opus_int16 *pNLSFW_Q_OUT, /* O: Pointer to input vector weights [D x 1] */
44 const opus_int16 *pNLSF_Q15, /* I: Pointer to input vector [D x 1] */
45 const opus_int D /* I: Input vector dimension (even) */
46)
47{
48 opus_int k;
49 opus_int32 tmp1_int, tmp2_int;
50
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070051 silk_assert( D > 0 );
52 silk_assert( ( D & 1 ) == 0 );
Gregory Maxwellae231142011-07-30 08:18:48 -040053
54 /* First value */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070055 tmp1_int = silk_max_int( pNLSF_Q15[ 0 ], 1 );
56 tmp1_int = silk_DIV32_16( 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( 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 );
Gregory Maxwellae231142011-07-30 08:18:48 -040061
62 /* Main loop */
63 for( k = 1; k < D - 1; k += 2 ) {
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070064 tmp1_int = silk_max_int( pNLSF_Q15[ k + 1 ] - pNLSF_Q15[ k ], 1 );
65 tmp1_int = silk_DIV32_16( 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 );
Gregory Maxwellae231142011-07-30 08:18:48 -040068
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070069 tmp2_int = silk_max_int( pNLSF_Q15[ k + 2 ] - pNLSF_Q15[ k + 1 ], 1 );
70 tmp2_int = silk_DIV32_16( 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 );
Gregory Maxwellae231142011-07-30 08:18:48 -040073 }
74
75 /* Last value */
Jean-Marc Valinfb3a4372011-09-16 00:58:26 -070076 tmp1_int = silk_max_int( ( 1 << 15 ) - pNLSF_Q15[ D - 1 ], 1 );
77 tmp1_int = silk_DIV32_16( 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 );
Gregory Maxwellae231142011-07-30 08:18:48 -040080}