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
|
/*
* The MIT License (MIT)
*
* Copyright (c) 2016 Matthias P. Braendli, Maximilien Cuony
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "GPIO/analog.h"
#define SUPPLY_HISTORY_LEN 10
// Hysteresis:
#define SUPPLY_QRP 12.1f
#define SUPPLY_QRO 12.5f
static float supply_history[SUPPLY_HISTORY_LEN];
static int supply_history_ix = 0;
static int supply_history_ready = 0;
static int last_qrp = 0;
// Return 1 if analog supply is too low
int analog_supply_too_low(void)
{
const float measure = analog_measure_12v();
supply_history[supply_history_ix] = measure;
supply_history_ix++;
if (supply_history_ix >= SUPPLY_HISTORY_LEN) {
supply_history_ix = 0;
supply_history_ready = 1;
}
if (supply_history_ready) {
float sum = 0.0f;
for (int i = 0; i < SUPPLY_HISTORY_LEN; i++) {
sum += supply_history[i];
}
int above_lower_limit = (sum > SUPPLY_QRP * SUPPLY_HISTORY_LEN);
int above_upper_limit = (sum > SUPPLY_QRO * SUPPLY_HISTORY_LEN);
if (!above_lower_limit) {
last_qrp = 1;
}
else if (above_upper_limit) {
last_qrp = 0;
}
return last_qrp;
}
return 0;
}
|
