summaryrefslogtreecommitdiffstats
path: root/lib/rainbow_oscillator.c
blob: 1a56b55487ff1cb1fcc1b15e37cd7eba30890ced (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
// Rainbow Oscillator
//
// rainbow_oscillator
//
// Rainbow Oscillator
//
// 
//
// Inputs:    1
// Outputs:   1
// Constants: 0


#include "ts.h"


ts_parameter_t const ts_rainbow_oscillator_p = { .n_inputs = 1, .n_outputs = 1, .n_constants = 0, .params_size = 0 };

uint_t ts_rainbow_oscillator_offset( ts_constant_t const *c )
{
	( void )c;
	return ( 13 );
}

int ts_rainbow_oscillator(
	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_rainbow_oscillator_p );
	(void)c;
	uint_t const periods[] = { 2, 4, 6, 8, 10, 12, 14 };
	uint_t const num_periods = 7;

	for( uint_t j = 0; j < n && j < 13; ++j ) y[0][j] = 0;
	for( uint_t i = 13; i < n; ++i )
	{
		fp_t ma_values[7];

		for( uint_t p = 0; p < num_periods; ++p )
		{
			fp_t sum = 0;
			for( uint_t j = 0; j < periods[p]; ++j )
			{
				sum += x[0][i - j];
			}
			ma_values[p] = sum / periods[p];
		}

		fp_t min_ma = ma_values[0];
		fp_t max_ma = ma_values[0];
		for( uint_t p = 1; p < num_periods; ++p )
		{
			if( ma_values[p] < min_ma )
				min_ma = ma_values[p];
			if( ma_values[p] > max_ma )
				max_ma = ma_values[p];
		}

		if( max_ma == min_ma )
			y[0][i] = 0;
		else
			y[0][i] = ( x[0][i] - min_ma ) / ( max_ma - min_ma ) * 100.0;
	}
	return 0;
}