| OLD | NEW |
| (Empty) | |
| 1 /*********************************************************************** |
| 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| 3 Redistribution and use in source and binary forms, with or without |
| 4 modification, are permitted provided that the following conditions |
| 5 are met: |
| 6 - Redistributions of source code must retain the above copyright notice, |
| 7 this list of conditions and the following disclaimer. |
| 8 - Redistributions in binary form must reproduce the above copyright |
| 9 notice, this list of conditions and the following disclaimer in the |
| 10 documentation and/or other materials provided with the distribution. |
| 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| 12 names of specific contributors, may be used to endorse or promote |
| 13 products derived from this software without specific prior written |
| 14 permission. |
| 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” |
| 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 25 POSSIBILITY OF SUCH DAMAGE. |
| 26 ***********************************************************************/ |
| 27 |
| 28 #ifdef HAVE_CONFIG_H |
| 29 #include "config.h" |
| 30 #endif |
| 31 |
| 32 #include "SigProc_FIX.h" |
| 33 |
| 34 /* Compute autocorrelation */ |
| 35 void silk_autocorr( |
| 36 opus_int32 *results, /* O Result (length corre
lationCount) */ |
| 37 opus_int *scale, /* O Scaling of the corre
lation vector */ |
| 38 const opus_int16 *inputData, /* I Input data to correl
ate */ |
| 39 const opus_int inputDataSize, /* I Length of input
*/ |
| 40 const opus_int correlationCount /* I Number of correlatio
n taps to compute */ |
| 41 ) |
| 42 { |
| 43 opus_int i, lz, nRightShifts, corrCount; |
| 44 opus_int64 corr64; |
| 45 |
| 46 corrCount = silk_min_int( inputDataSize, correlationCount ); |
| 47 |
| 48 /* compute energy (zero-lag correlation) */ |
| 49 corr64 = silk_inner_prod16_aligned_64( inputData, inputData, inputDataSize )
; |
| 50 |
| 51 /* deal with all-zero input data */ |
| 52 corr64 += 1; |
| 53 |
| 54 /* number of leading zeros */ |
| 55 lz = silk_CLZ64( corr64 ); |
| 56 |
| 57 /* scaling: number of right shifts applied to correlations */ |
| 58 nRightShifts = 35 - lz; |
| 59 *scale = nRightShifts; |
| 60 |
| 61 if( nRightShifts <= 0 ) { |
| 62 results[ 0 ] = silk_LSHIFT( (opus_int32)silk_CHECK_FIT32( corr64 ), -nRi
ghtShifts ); |
| 63 |
| 64 /* compute remaining correlations based on int32 inner product */ |
| 65 for( i = 1; i < corrCount; i++ ) { |
| 66 results[ i ] = silk_LSHIFT( silk_inner_prod_aligned( inputData, inpu
tData + i, inputDataSize - i ), -nRightShifts ); |
| 67 } |
| 68 } else { |
| 69 results[ 0 ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( corr64, nRig
htShifts ) ); |
| 70 |
| 71 /* compute remaining correlations based on int64 inner product */ |
| 72 for( i = 1; i < corrCount; i++ ) { |
| 73 results[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( silk_in
ner_prod16_aligned_64( inputData, inputData + i, inputDataSize - i ), nRightShif
ts ) ); |
| 74 } |
| 75 } |
| 76 } |
| OLD | NEW |