blob: 44d7974be3cdd915e8e1af0e68eebcc916ae435a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/*
* Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
* Copyright (C) 2008 - INRIA - Arnaud TORSET
*
* This file must be used under the terms of the CeCILL.
* This source file is licensed as described in the file COPYING, which
* you should have received as part of this distribution. The terms
* are also available at
* http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
*
*/
/*Resolve the Yule-Walker equations:
|r(0) r(1) ... r(N-1)|| a(1) | |sigma2|
|r(1) r(0) ... r(n-1)|| a(2) | | 0 |
| : : ... : || : |=| 0 |
| : : ... : || : | | 0 |
|r(N-1) r(N-2) ... r(0) ||a(N-1)| | 0 |
using Levinson's algorithm.
r :Correlation coefficients
ar :Auto-Regressive model parameters
sigma2 :Scale constant
rc :Reflection coefficients
*/
#include <stdlib.h>
#include "lev.h"
float sleva2(float* in,int size, float* ar){
int i=0, j=0;
float accu=0;
float* ak1;
float sigma2;
/* FIXME : malloc here */
ak1=(float*)malloc((unsigned int)size*sizeof(float));
/* initialize levinson's algorithm */
ar[0]=-in[1]/in[0];
sigma2=(1-ar[0]*ar[0])*in[0];
ak1[0]=0;
/* iterative solution to yule-walker equations */
for (i=1;i<size-1;i++){
accu=0;
for (j=0;j<i;j++){
accu+=ar[j]*in[i-j];
}
ak1[i]=-(in[i+1]+accu)/sigma2;
for (j=0;j<i;j++){
ak1[j] = ar[j]+ak1[i]*ar[i-1-j];
}
sigma2=(1-ak1[i]*ak1[i])*sigma2;
for (j=0;j<=i;j++){
ar[j]=ak1[j];
}
}
free(ak1);
return sigma2;
}
|
