1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/media/libopus/silk/NLSF_VQ_weights_laroia.c Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,80 @@
1.4 +/***********************************************************************
1.5 +Copyright (c) 2006-2011, Skype Limited. All rights reserved.
1.6 +Redistribution and use in source and binary forms, with or without
1.7 +modification, are permitted provided that the following conditions
1.8 +are met:
1.9 +- Redistributions of source code must retain the above copyright notice,
1.10 +this list of conditions and the following disclaimer.
1.11 +- Redistributions in binary form must reproduce the above copyright
1.12 +notice, this list of conditions and the following disclaimer in the
1.13 +documentation and/or other materials provided with the distribution.
1.14 +- Neither the name of Internet Society, IETF or IETF Trust, nor the
1.15 +names of specific contributors, may be used to endorse or promote
1.16 +products derived from this software without specific prior written
1.17 +permission.
1.18 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.19 +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.20 +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.21 +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
1.22 +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.23 +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.24 +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.25 +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.26 +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.27 +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.28 +POSSIBILITY OF SUCH DAMAGE.
1.29 +***********************************************************************/
1.30 +
1.31 +#ifdef HAVE_CONFIG_H
1.32 +#include "config.h"
1.33 +#endif
1.34 +
1.35 +#include "define.h"
1.36 +#include "SigProc_FIX.h"
1.37 +
1.38 +/*
1.39 +R. Laroia, N. Phamdo and N. Farvardin, "Robust and Efficient Quantization of Speech LSP
1.40 +Parameters Using Structured Vector Quantization", Proc. IEEE Int. Conf. Acoust., Speech,
1.41 +Signal Processing, pp. 641-644, 1991.
1.42 +*/
1.43 +
1.44 +/* Laroia low complexity NLSF weights */
1.45 +void silk_NLSF_VQ_weights_laroia(
1.46 + opus_int16 *pNLSFW_Q_OUT, /* O Pointer to input vector weights [D] */
1.47 + const opus_int16 *pNLSF_Q15, /* I Pointer to input vector [D] */
1.48 + const opus_int D /* I Input vector dimension (even) */
1.49 +)
1.50 +{
1.51 + opus_int k;
1.52 + opus_int32 tmp1_int, tmp2_int;
1.53 +
1.54 + silk_assert( D > 0 );
1.55 + silk_assert( ( D & 1 ) == 0 );
1.56 +
1.57 + /* First value */
1.58 + tmp1_int = silk_max_int( pNLSF_Q15[ 0 ], 1 );
1.59 + tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int );
1.60 + tmp2_int = silk_max_int( pNLSF_Q15[ 1 ] - pNLSF_Q15[ 0 ], 1 );
1.61 + tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int );
1.62 + pNLSFW_Q_OUT[ 0 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
1.63 + silk_assert( pNLSFW_Q_OUT[ 0 ] > 0 );
1.64 +
1.65 + /* Main loop */
1.66 + for( k = 1; k < D - 1; k += 2 ) {
1.67 + tmp1_int = silk_max_int( pNLSF_Q15[ k + 1 ] - pNLSF_Q15[ k ], 1 );
1.68 + tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int );
1.69 + pNLSFW_Q_OUT[ k ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
1.70 + silk_assert( pNLSFW_Q_OUT[ k ] > 0 );
1.71 +
1.72 + tmp2_int = silk_max_int( pNLSF_Q15[ k + 2 ] - pNLSF_Q15[ k + 1 ], 1 );
1.73 + tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int );
1.74 + pNLSFW_Q_OUT[ k + 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
1.75 + silk_assert( pNLSFW_Q_OUT[ k + 1 ] > 0 );
1.76 + }
1.77 +
1.78 + /* Last value */
1.79 + tmp1_int = silk_max_int( ( 1 << 15 ) - pNLSF_Q15[ D - 1 ], 1 );
1.80 + tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int );
1.81 + pNLSFW_Q_OUT[ D - 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX );
1.82 + silk_assert( pNLSFW_Q_OUT[ D - 1 ] > 0 );
1.83 +}
