blob: 8519d1333de955d4800bef41f9c04c132ca8f35a (
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
// Linear Decay
//
// decay_linear - decay
//
// Propogates the maximum values of a function into the future for at most k periods
//
// y_i = max( x_i, y_i-1 - k )
//
// Inputs: 1
// Outputs: 1
// Constants: 0
#include <math.h>
#include "ts.h"
typedef struct {
uint_t k;
} ts_decay_linear_params_t;
ts_parameter_t const ts_decay_linear_p = { .n_inputs = 1, .n_outputs = 1, .n_constants = 1, .params_size = sizeof(ts_decay_linear_params_t) };
uint_t ts_decay_linear_offset( ts_constant_t const *c )
{
( void )c;
return ( c ? ((ts_decay_linear_params_t *)c)->k : 0 );
}
int ts_decay_linear(
fp_t * const *y, uint_t y_n,
fp_t const * const *x, uint_t x_n,
uint_t n, ts_constant_t const *c
)
{
TS_PROLOGUE( ts_decay_linear_p );
if ( !c ) return -1;
uint_t k = ((ts_decay_linear_params_t *)c)->k;
if (k == 0 || n < k) return -1;
for (uint_t zi = 0; zi < k; ++zi) y[0][zi] = 0;
uint_t xi = 1;
fp_t prev = x[0][0];
fp_t r = prev / k;
for( ; xi < k; xi++ )
{
prev -= r;
if( x[0][xi] > prev )
{
prev = x[0][xi];
r = x[0][xi] / k;
}
else
{
prev = fmax( prev, 0 );
}
}
for( uint_t yi = k; xi < n; xi++, yi++ )
{
fp_t curr = prev - r;
if( x[0][xi] > curr )
{
curr = x[0][xi];
r = x[0][xi] / k;
}
else
{
curr = fmax( curr, 0 );
}
y[0][yi] = curr;
prev = curr;
}
return 0;
}
|