mirror of
https://github.com/DrBeef/ioq3quest.git
synced 2024-11-14 08:31:00 +00:00
93 lines
4.7 KiB
C
93 lines
4.7 KiB
C
/***********************************************************************
|
|
Copyright (c) 2006-2011, Skype Limited. All rights reserved.
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
- Redistributions of source code must retain the above copyright notice,
|
|
this list of conditions and the following disclaimer.
|
|
- Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
- Neither the name of Internet Society, IETF or IETF Trust, nor the
|
|
names of specific contributors, may be used to endorse or promote
|
|
products derived from this software without specific prior written
|
|
permission.
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
POSSIBILITY OF SUCH DAMAGE.
|
|
***********************************************************************/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
|
|
/**********************************************************************
|
|
* Correlation matrix computations for LS estimate.
|
|
**********************************************************************/
|
|
|
|
#include "main_FLP.h"
|
|
|
|
/* Calculates correlation vector X'*t */
|
|
void silk_corrVector_FLP(
|
|
const silk_float *x, /* I x vector [L+order-1] used to create X */
|
|
const silk_float *t, /* I Target vector [L] */
|
|
const opus_int L, /* I Length of vecors */
|
|
const opus_int Order, /* I Max lag for correlation */
|
|
silk_float *Xt /* O X'*t correlation vector [order] */
|
|
)
|
|
{
|
|
opus_int lag;
|
|
const silk_float *ptr1;
|
|
|
|
ptr1 = &x[ Order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */
|
|
for( lag = 0; lag < Order; lag++ ) {
|
|
/* Calculate X[:,lag]'*t */
|
|
Xt[ lag ] = (silk_float)silk_inner_product_FLP( ptr1, t, L );
|
|
ptr1--; /* Next column of X */
|
|
}
|
|
}
|
|
|
|
/* Calculates correlation matrix X'*X */
|
|
void silk_corrMatrix_FLP(
|
|
const silk_float *x, /* I x vector [ L+order-1 ] used to create X */
|
|
const opus_int L, /* I Length of vectors */
|
|
const opus_int Order, /* I Max lag for correlation */
|
|
silk_float *XX /* O X'*X correlation matrix [order x order] */
|
|
)
|
|
{
|
|
opus_int j, lag;
|
|
double energy;
|
|
const silk_float *ptr1, *ptr2;
|
|
|
|
ptr1 = &x[ Order - 1 ]; /* First sample of column 0 of X */
|
|
energy = silk_energy_FLP( ptr1, L ); /* X[:,0]'*X[:,0] */
|
|
matrix_ptr( XX, 0, 0, Order ) = ( silk_float )energy;
|
|
for( j = 1; j < Order; j++ ) {
|
|
/* Calculate X[:,j]'*X[:,j] */
|
|
energy += ptr1[ -j ] * ptr1[ -j ] - ptr1[ L - j ] * ptr1[ L - j ];
|
|
matrix_ptr( XX, j, j, Order ) = ( silk_float )energy;
|
|
}
|
|
|
|
ptr2 = &x[ Order - 2 ]; /* First sample of column 1 of X */
|
|
for( lag = 1; lag < Order; lag++ ) {
|
|
/* Calculate X[:,0]'*X[:,lag] */
|
|
energy = silk_inner_product_FLP( ptr1, ptr2, L );
|
|
matrix_ptr( XX, lag, 0, Order ) = ( silk_float )energy;
|
|
matrix_ptr( XX, 0, lag, Order ) = ( silk_float )energy;
|
|
/* Calculate X[:,j]'*X[:,j + lag] */
|
|
for( j = 1; j < ( Order - lag ); j++ ) {
|
|
energy += ptr1[ -j ] * ptr2[ -j ] - ptr1[ L - j ] * ptr2[ L - j ];
|
|
matrix_ptr( XX, lag + j, j, Order ) = ( silk_float )energy;
|
|
matrix_ptr( XX, j, lag + j, Order ) = ( silk_float )energy;
|
|
}
|
|
ptr2--; /* Next column of X */
|
|
}
|
|
}
|