media/libopus/silk/float/schur_FLP.c@b8a032363ba2 (annotated)
media/libopus/silk/float/schur_FLP.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 "SigProc_FLP.h" |
| michael@0 | 33 | |
| michael@0 | 34 | silk_float silk_schur_FLP( /* O returns residual energy */ |
| michael@0 | 35 | silk_float refl_coef[], /* O reflection coefficients (length order) */ |
| michael@0 | 36 | const silk_float auto_corr[], /* I autocorrelation sequence (length order+1) */ |
| michael@0 | 37 | opus_int order /* I order */ |
| michael@0 | 38 | ) |
| michael@0 | 39 | { |
| michael@0 | 40 | opus_int k, n; |
| michael@0 | 41 | silk_float C[ SILK_MAX_ORDER_LPC + 1 ][ 2 ]; |
| michael@0 | 42 | silk_float Ctmp1, Ctmp2, rc_tmp; |
| michael@0 | 43 | |
| michael@0 | 44 | silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 ); |
| michael@0 | 45 | |
| michael@0 | 46 | /* Copy correlations */ |
| michael@0 | 47 | for( k = 0; k < order+1; k++ ) { |
| michael@0 | 48 | C[ k ][ 0 ] = C[ k ][ 1 ] = auto_corr[ k ]; |
| michael@0 | 49 | } |
| michael@0 | 50 | |
| michael@0 | 51 | for( k = 0; k < order; k++ ) { |
| michael@0 | 52 | /* Get reflection coefficient */ |
| michael@0 | 53 | rc_tmp = -C[ k + 1 ][ 0 ] / silk_max_float( C[ 0 ][ 1 ], 1e-9f ); |
| michael@0 | 54 | |
| michael@0 | 55 | /* Save the output */ |
| michael@0 | 56 | refl_coef[ k ] = rc_tmp; |
| michael@0 | 57 | |
| michael@0 | 58 | /* Update correlations */ |
| michael@0 | 59 | for( n = 0; n < order - k; n++ ) { |
| michael@0 | 60 | Ctmp1 = C[ n + k + 1 ][ 0 ]; |
| michael@0 | 61 | Ctmp2 = C[ n ][ 1 ]; |
| michael@0 | 62 | C[ n + k + 1 ][ 0 ] = Ctmp1 + Ctmp2 * rc_tmp; |
| michael@0 | 63 | C[ n ][ 1 ] = Ctmp2 + Ctmp1 * rc_tmp; |
| michael@0 | 64 | } |
| michael@0 | 65 | } |
| michael@0 | 66 | |
| michael@0 | 67 | /* Return residual energy */ |
| michael@0 | 68 | return C[ 0 ][ 1 ]; |
| michael@0 | 69 | } |
| michael@0 | 70 |
