media/libopus/silk/fixed/warped_autocorrelation_FIX.c@b8a032363ba2 (annotated)
media/libopus/silk/fixed/warped_autocorrelation_FIX.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 "main_FIX.h" |
| michael@0 | 33 | |
| michael@0 | 34 | #define QC 10 |
| michael@0 | 35 | #define QS 14 |
| michael@0 | 36 | |
| michael@0 | 37 | /* Autocorrelations for a warped frequency axis */ |
| michael@0 | 38 | void silk_warped_autocorrelation_FIX( |
| michael@0 | 39 | opus_int32 *corr, /* O Result [order + 1] */ |
| michael@0 | 40 | opus_int *scale, /* O Scaling of the correlation vector */ |
| michael@0 | 41 | const opus_int16 *input, /* I Input data to correlate */ |
| michael@0 | 42 | const opus_int warping_Q16, /* I Warping coefficient */ |
| michael@0 | 43 | const opus_int length, /* I Length of input */ |
| michael@0 | 44 | const opus_int order /* I Correlation order (even) */ |
| michael@0 | 45 | ) |
| michael@0 | 46 | { |
| michael@0 | 47 | opus_int n, i, lsh; |
| michael@0 | 48 | opus_int32 tmp1_QS, tmp2_QS; |
| michael@0 | 49 | opus_int32 state_QS[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 }; |
| michael@0 | 50 | opus_int64 corr_QC[ MAX_SHAPE_LPC_ORDER + 1 ] = { 0 }; |
| michael@0 | 51 | |
| michael@0 | 52 | /* Order must be even */ |
| michael@0 | 53 | silk_assert( ( order & 1 ) == 0 ); |
| michael@0 | 54 | silk_assert( 2 * QS - QC >= 0 ); |
| michael@0 | 55 | |
| michael@0 | 56 | /* Loop over samples */ |
| michael@0 | 57 | for( n = 0; n < length; n++ ) { |
| michael@0 | 58 | tmp1_QS = silk_LSHIFT32( (opus_int32)input[ n ], QS ); |
| michael@0 | 59 | /* Loop over allpass sections */ |
| michael@0 | 60 | for( i = 0; i < order; i += 2 ) { |
| michael@0 | 61 | /* Output of allpass section */ |
| michael@0 | 62 | tmp2_QS = silk_SMLAWB( state_QS[ i ], state_QS[ i + 1 ] - tmp1_QS, warping_Q16 ); |
| michael@0 | 63 | state_QS[ i ] = tmp1_QS; |
| michael@0 | 64 | corr_QC[ i ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC ); |
| michael@0 | 65 | /* Output of allpass section */ |
| michael@0 | 66 | tmp1_QS = silk_SMLAWB( state_QS[ i + 1 ], state_QS[ i + 2 ] - tmp2_QS, warping_Q16 ); |
| michael@0 | 67 | state_QS[ i + 1 ] = tmp2_QS; |
| michael@0 | 68 | corr_QC[ i + 1 ] += silk_RSHIFT64( silk_SMULL( tmp2_QS, state_QS[ 0 ] ), 2 * QS - QC ); |
| michael@0 | 69 | } |
| michael@0 | 70 | state_QS[ order ] = tmp1_QS; |
| michael@0 | 71 | corr_QC[ order ] += silk_RSHIFT64( silk_SMULL( tmp1_QS, state_QS[ 0 ] ), 2 * QS - QC ); |
| michael@0 | 72 | } |
| michael@0 | 73 | |
| michael@0 | 74 | lsh = silk_CLZ64( corr_QC[ 0 ] ) - 35; |
| michael@0 | 75 | lsh = silk_LIMIT( lsh, -12 - QC, 30 - QC ); |
| michael@0 | 76 | *scale = -( QC + lsh ); |
| michael@0 | 77 | silk_assert( *scale >= -30 && *scale <= 12 ); |
| michael@0 | 78 | if( lsh >= 0 ) { |
| michael@0 | 79 | for( i = 0; i < order + 1; i++ ) { |
| michael@0 | 80 | corr[ i ] = (opus_int32)silk_CHECK_FIT32( silk_LSHIFT64( corr_QC[ i ], lsh ) ); |
| michael@0 | 81 | } |
| michael@0 | 82 | } else { |
| michael@0 | 83 | for( i = 0; i < order + 1; i++ ) { |
| michael@0 | 84 | corr[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( corr_QC[ i ], -lsh ) ); |
| michael@0 | 85 | } |
| michael@0 | 86 | } |
| michael@0 | 87 | silk_assert( corr_QC[ 0 ] >= 0 ); /* If breaking, decrease QC*/ |
| michael@0 | 88 | } |
