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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
// Copyright 2022, Collabora, Ltd.
// SPDX-License-Identifier: BSL-1.0
/*!
* @file
* @brief Integer low pass filter tests.
* @author Rylie Pavlik <rylie.pavlik@collabora.com>
*/
#include <math/m_lowpass_integer.hpp>
#include <math/m_lowpass_integer.h>
#include "catch_amalgamated.hpp"
using xrt::auxiliary::math::IntegerLowPassIIRFilter;
using xrt::auxiliary::math::Rational;
static constexpr uint16_t InitialState = 300;
TEMPLATE_TEST_CASE("IntegerLowPassIIRFilter", "", int32_t, uint32_t)
{
IntegerLowPassIIRFilter<TestType> filter(Rational<TestType>{1, 2});
CHECK_FALSE(filter.isInitialized());
filter.addSample(InitialState);
CHECK(filter.getState() == InitialState);
CHECK(filter.isInitialized());
auto prev = filter.getState();
SECTION("Increase")
{
constexpr auto newTarget = InitialState * 2;
for (int i = 0; i < 20; ++i) {
filter.addSample(newTarget);
REQUIRE(filter.isInitialized());
// not going to exceed this
if (prev == newTarget || prev == newTarget - 1) {
REQUIRE(filter.getState() == prev);
} else {
REQUIRE(filter.getState() > prev);
prev = filter.getState();
}
}
}
SECTION("Decrease")
{
constexpr auto newTarget = InitialState / 2;
for (int i = 0; i < 20; ++i) {
filter.addSample(newTarget);
REQUIRE(filter.isInitialized());
if (prev == newTarget) {
REQUIRE(filter.getState() == newTarget);
} else {
REQUIRE(filter.getState() < prev);
prev = filter.getState();
}
}
}
SECTION("Stay Same")
{
for (int i = 0; i < 20; ++i) {
filter.addSample(InitialState);
REQUIRE(filter.isInitialized());
REQUIRE(filter.getState() == InitialState);
}
}
}
TEST_CASE("m_lowpass_integer")
{
struct m_lowpass_integer *filter = m_lowpass_integer_create(1, 2);
CHECK(filter);
CHECK_FALSE(m_lowpass_integer_is_initialized(filter));
m_lowpass_integer_add_sample(filter, InitialState);
REQUIRE(m_lowpass_integer_is_initialized(filter));
CHECK(m_lowpass_integer_get_state(filter) == InitialState);
auto prev = m_lowpass_integer_get_state(filter);
SECTION("Increase")
{
constexpr auto newTarget = InitialState * 2;
for (int i = 0; i < 20; ++i) {
m_lowpass_integer_add_sample(filter, newTarget);
REQUIRE(m_lowpass_integer_is_initialized(filter));
// not going to exceed this
if (prev == newTarget || prev == newTarget - 1) {
REQUIRE(m_lowpass_integer_get_state(filter) == prev);
} else {
REQUIRE(m_lowpass_integer_get_state(filter) > prev);
prev = m_lowpass_integer_get_state(filter);
}
}
}
SECTION("Decrease")
{
constexpr auto newTarget = InitialState / 2;
for (int i = 0; i < 20; ++i) {
m_lowpass_integer_add_sample(filter, newTarget);
REQUIRE(m_lowpass_integer_is_initialized(filter));
if (prev == newTarget) {
REQUIRE(m_lowpass_integer_get_state(filter) == newTarget);
} else {
REQUIRE(m_lowpass_integer_get_state(filter) < prev);
prev = m_lowpass_integer_get_state(filter);
}
}
}
SECTION("Stay Same")
{
for (int i = 0; i < 20; ++i) {
m_lowpass_integer_add_sample(filter, InitialState);
REQUIRE(m_lowpass_integer_is_initialized(filter));
REQUIRE(m_lowpass_integer_get_state(filter) == InitialState);
}
}
}
|
