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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
#include "base/Window.h"
#include "base/KaiserWindow.h"
#include "base/SincWindow.h"
#include <iostream>
#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MAIN
#include <boost/test/unit_test.hpp>
BOOST_AUTO_TEST_SUITE(TestWindow)
using std::cout;
using std::endl;
#define COMPARE_ARRAY(a, b) \
for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-4); \
}
void
testSymmetric(double *d, int n)
{
for (int i = 0; i <= n/2; ++i) {
BOOST_CHECK_CLOSE(d[i], d[n-i-1], 1e-10);
}
}
BOOST_AUTO_TEST_CASE(periodic)
{
// We can't actually test whether a function is periodic, given
// only one cycle of it! But we can make sure that all but the
// first sample is symmetric, which is what a symmetric window
// becomes when generated in periodic mode
double d[9];
for (int n = 8; n <= 9; ++n) {
for (int wt = (int)FirstWindow; wt <= (int)LastWindow; ++wt) {
for (int i = 0; i < n; ++i) d[i] = 1.0;
Window<double> w((WindowType)wt, n);
w.cut(d);
testSymmetric(d + 1, n - 1);
}
}
}
template <int N>
void testWindow(WindowType type, const double expected[N])
{
double d[N];
for (int i = 0; i < N; ++i) d[i] = 1.0;
Window<double> w(type, N);
w.cut(d);
COMPARE_ARRAY(d, expected);
double d0[N], d1[N];
for (int i = 0; i < N; ++i) d0[i] = 0.5 + (1.0 / (N * 2)) * (i + 1);
w.cut(d0, d1);
for (int i = 0; i < N; ++i) {
BOOST_CHECK_SMALL(d1[i] - d0[i] * expected[i], 1e-4);
}
}
BOOST_AUTO_TEST_CASE(bartlett)
{
double e1[] = { 1 };
testWindow<1>(BartlettWindow, e1);
double e2[] = { 0, 0 };
testWindow<2>(BartlettWindow, e2);
double e3[] = { 0, 2./3., 2./3. };
testWindow<3>(BartlettWindow, e3);
double e4[] = { 0, 1./2., 1., 1./2. };
testWindow<4>(BartlettWindow, e4);
double e5[] = { 0, 1./2., 1., 1., 1./2. };
testWindow<5>(BartlettWindow, e5);
double e6[] = { 0, 1./3., 2./3., 1., 2./3., 1./3. };
testWindow<6>(BartlettWindow, e6);
}
BOOST_AUTO_TEST_CASE(hamming)
{
double e1[] = { 1 };
testWindow<1>(HammingWindow, e1);
double e10[] = {
0.0800, 0.1679, 0.3979, 0.6821, 0.9121,
1.0000, 0.9121, 0.6821, 0.3979, 0.1679
};
testWindow<10>(HammingWindow, e10);
}
BOOST_AUTO_TEST_CASE(hann)
{
double e1[] = { 1 };
testWindow<1>(HanningWindow, e1);
double e10[] = {
0, 0.0955, 0.3455, 0.6545, 0.9045,
1.0000, 0.9045, 0.6545, 0.3455, 0.0955,
};
testWindow<10>(HanningWindow, e10);
}
BOOST_AUTO_TEST_CASE(blackman)
{
double e1[] = { 1 };
testWindow<1>(BlackmanWindow, e1);
double e10[] = {
0, 0.0402, 0.2008, 0.5098, 0.8492,
1.0000, 0.8492, 0.5098, 0.2008, 0.0402,
};
testWindow<10>(BlackmanWindow, e10);
}
BOOST_AUTO_TEST_CASE(blackmanHarris)
{
double e1[] = { 1 };
testWindow<1>(BlackmanHarrisWindow, e1);
double e10[] = {
0.0001, 0.0110, 0.1030, 0.3859, 0.7938,
1.0000, 0.7938, 0.3859, 0.1030, 0.0110,
};
testWindow<10>(BlackmanHarrisWindow, e10);
}
BOOST_AUTO_TEST_CASE(kaiser_4_10)
{
double d[10];
for (int i = 0; i < 10; ++i) d[i] = 1.0;
double e[] = {
0.0885, 0.2943, 0.5644, 0.8216, 0.9789,
0.9789, 0.8216, 0.5644, 0.2943, 0.0885
};
KaiserWindow::Parameters p;
p.length = 10;
p.beta = 4;
KaiserWindow k(p);
k.cut(d);
COMPARE_ARRAY(d, e);
}
BOOST_AUTO_TEST_CASE(kaiser_2p5_11)
{
double d[11];
for (int i = 0; i < 11; ++i) d[i] = 1.0;
double e[] = {
0.3040, 0.5005, 0.6929, 0.8546, 0.9622,
1.0000, 0.9622, 0.8546, 0.6929, 0.5005, 0.3040
};
KaiserWindow::Parameters p;
p.length = 11;
p.beta = 2.5;
KaiserWindow k(p);
k.cut(d);
COMPARE_ARRAY(d, e);
}
//!!! todo: tests for kaiser with attenuation and bandwidth parameters
template <int N>
void testSinc(double p, const double expected[N])
{
double d[N];
for (int i = 0; i < N; ++i) d[i] = 1.0;
SincWindow w(N, p);
w.cut(d);
COMPARE_ARRAY(d, expected);
double d0[N], d1[N];
for (int i = 0; i < N; ++i) d0[i] = 0.5 + (1.0 / (N * 2)) * (i + 1);
w.cut(d0, d1);
for (int i = 0; i < N; ++i) {
BOOST_CHECK_SMALL(d1[i] - d0[i] * expected[i], 1e-4);
}
}
BOOST_AUTO_TEST_CASE(sinc)
{
double e1[] = { 0, 0, 1, 0, 0 };
testSinc<5>(1, e1);
double e2[] = { 0, 0, 1, 0, 0 };
testSinc<5>(2, e2);
double e3[] = { -0.2122, 0.0, 0.6366, 1.0, 0.6366, 0, -0.2122 };
testSinc<7>(4, e3);
double e4[] = { -0.2122, 0, 0.6366, 1, 0.6366, 0 };
testSinc<6>(4, e4);
}
BOOST_AUTO_TEST_SUITE_END()
|
