media/libopus/silk/NLSF_VQ_weights_laroia.c@b8a032363ba2 (annotated)
media/libopus/silk/NLSF_VQ_weights_laroia.c
Thu, 22 Jan 2015 13:21:57 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 22 Jan 2015 13:21:57 +0100
- branch
- TOR_BUG_9701
- changeset 15
- b8a032363ba2
- permissions
- -rw-r--r--
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
| michael@0 | 1 | /*********************************************************************** |
| michael@0 | 2 | Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| michael@0 | 3 | Redistribution and use in source and binary forms, with or without |
| michael@0 | 4 | modification, are permitted provided that the following conditions |
| michael@0 | 5 | are met: |
| michael@0 | 6 | - Redistributions of source code must retain the above copyright notice, |
| michael@0 | 7 | this list of conditions and the following disclaimer. |
| michael@0 | 8 | - Redistributions in binary form must reproduce the above copyright |
| michael@0 | 9 | notice, this list of conditions and the following disclaimer in the |
| michael@0 | 10 | documentation and/or other materials provided with the distribution. |
| michael@0 | 11 | - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| michael@0 | 12 | names of specific contributors, may be used to endorse or promote |
| michael@0 | 13 | products derived from this software without specific prior written |
| michael@0 | 14 | permission. |
| michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| michael@0 | 16 | AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| michael@0 | 18 | ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| michael@0 | 19 | LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| michael@0 | 20 | CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| michael@0 | 21 | SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| michael@0 | 22 | INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| michael@0 | 23 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| michael@0 | 24 | ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| michael@0 | 25 | POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 26 | ***********************************************************************/ |
| michael@0 | 27 | |
| michael@0 | 28 | #ifdef HAVE_CONFIG_H |
| michael@0 | 29 | #include "config.h" |
| michael@0 | 30 | #endif |
| michael@0 | 31 | |
| michael@0 | 32 | #include "define.h" |
| michael@0 | 33 | #include "SigProc_FIX.h" |
| michael@0 | 34 | |
| michael@0 | 35 | /* |
| michael@0 | 36 | R. Laroia, N. Phamdo and N. Farvardin, "Robust and Efficient Quantization of Speech LSP |
| michael@0 | 37 | Parameters Using Structured Vector Quantization", Proc. IEEE Int. Conf. Acoust., Speech, |
| michael@0 | 38 | Signal Processing, pp. 641-644, 1991. |
| michael@0 | 39 | */ |
| michael@0 | 40 | |
| michael@0 | 41 | /* Laroia low complexity NLSF weights */ |
| michael@0 | 42 | void silk_NLSF_VQ_weights_laroia( |
| michael@0 | 43 | opus_int16 *pNLSFW_Q_OUT, /* O Pointer to input vector weights [D] */ |
| michael@0 | 44 | const opus_int16 *pNLSF_Q15, /* I Pointer to input vector [D] */ |
| michael@0 | 45 | const opus_int D /* I Input vector dimension (even) */ |
| michael@0 | 46 | ) |
| michael@0 | 47 | { |
| michael@0 | 48 | opus_int k; |
| michael@0 | 49 | opus_int32 tmp1_int, tmp2_int; |
| michael@0 | 50 | |
| michael@0 | 51 | silk_assert( D > 0 ); |
| michael@0 | 52 | silk_assert( ( D & 1 ) == 0 ); |
| michael@0 | 53 | |
| michael@0 | 54 | /* First value */ |
| michael@0 | 55 | tmp1_int = silk_max_int( pNLSF_Q15[ 0 ], 1 ); |
| michael@0 | 56 | tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int ); |
| michael@0 | 57 | tmp2_int = silk_max_int( pNLSF_Q15[ 1 ] - pNLSF_Q15[ 0 ], 1 ); |
| michael@0 | 58 | tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int ); |
| michael@0 | 59 | pNLSFW_Q_OUT[ 0 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); |
| michael@0 | 60 | silk_assert( pNLSFW_Q_OUT[ 0 ] > 0 ); |
| michael@0 | 61 | |
| michael@0 | 62 | /* Main loop */ |
| michael@0 | 63 | for( k = 1; k < D - 1; k += 2 ) { |
| michael@0 | 64 | tmp1_int = silk_max_int( pNLSF_Q15[ k + 1 ] - pNLSF_Q15[ k ], 1 ); |
| michael@0 | 65 | tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int ); |
| michael@0 | 66 | pNLSFW_Q_OUT[ k ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); |
| michael@0 | 67 | silk_assert( pNLSFW_Q_OUT[ k ] > 0 ); |
| michael@0 | 68 | |
| michael@0 | 69 | tmp2_int = silk_max_int( pNLSF_Q15[ k + 2 ] - pNLSF_Q15[ k + 1 ], 1 ); |
| michael@0 | 70 | tmp2_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp2_int ); |
| michael@0 | 71 | pNLSFW_Q_OUT[ k + 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); |
| michael@0 | 72 | silk_assert( pNLSFW_Q_OUT[ k + 1 ] > 0 ); |
| michael@0 | 73 | } |
| michael@0 | 74 | |
| michael@0 | 75 | /* Last value */ |
| michael@0 | 76 | tmp1_int = silk_max_int( ( 1 << 15 ) - pNLSF_Q15[ D - 1 ], 1 ); |
| michael@0 | 77 | tmp1_int = silk_DIV32_16( (opus_int32)1 << ( 15 + NLSF_W_Q ), tmp1_int ); |
| michael@0 | 78 | pNLSFW_Q_OUT[ D - 1 ] = (opus_int16)silk_min_int( tmp1_int + tmp2_int, silk_int16_MAX ); |
| michael@0 | 79 | silk_assert( pNLSFW_Q_OUT[ D - 1 ] > 0 ); |
| michael@0 | 80 | } |
