annotate tests/TestWindow.cpp @ 110:87ad66aaed32

FFT and window tests
author Chris Cannam
date Mon, 30 Sep 2013 16:50:38 +0100
parents
children 469d234acb9e
rev   line source
Chris@110 1
Chris@110 2 #include "base/Window.h"
Chris@110 3
Chris@110 4 #include <iostream>
Chris@110 5
Chris@110 6 #define BOOST_TEST_DYN_LINK
Chris@110 7 #define BOOST_TEST_MAIN
Chris@110 8
Chris@110 9 #include <boost/test/unit_test.hpp>
Chris@110 10
Chris@110 11 BOOST_AUTO_TEST_SUITE(TestWindow)
Chris@110 12
Chris@110 13 using std::cout;
Chris@110 14 using std::endl;
Chris@110 15
Chris@110 16 #define COMPARE_ARRAY(a, b) \
Chris@110 17 for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
Chris@110 18 BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-4); \
Chris@110 19 }
Chris@110 20
Chris@110 21 void
Chris@110 22 testSymmetric(double *d, int n)
Chris@110 23 {
Chris@110 24 for (int i = 0; i <= n/2; ++i) {
Chris@110 25 BOOST_CHECK_CLOSE(d[i], d[n-i-1], 1e-10);
Chris@110 26 }
Chris@110 27 }
Chris@110 28
Chris@110 29 BOOST_AUTO_TEST_CASE(periodic)
Chris@110 30 {
Chris@110 31 // We can't actually test whether a function is periodic, given
Chris@110 32 // only one cycle of it! But we can make sure that all but the
Chris@110 33 // first sample is symmetric, which is what a symmetric window
Chris@110 34 // becomes when generated in periodic mode
Chris@110 35 double d[9];
Chris@110 36 for (int n = 8; n <= 9; ++n) {
Chris@110 37 for (int wt = (int)FirstWindow; wt <= (int)LastWindow; ++wt) {
Chris@110 38 for (int i = 0; i < n; ++i) d[i] = 1.0;
Chris@110 39 Window<double> w((WindowType)wt, n);
Chris@110 40 w.cut(d);
Chris@110 41 testSymmetric(d + 1, n - 1);
Chris@110 42 }
Chris@110 43 }
Chris@110 44 }
Chris@110 45
Chris@110 46 template <int N>
Chris@110 47 void testWindow(WindowType type, const double expected[N])
Chris@110 48 {
Chris@110 49 double d[N];
Chris@110 50 for (int i = 0; i < N; ++i) d[i] = 1.0;
Chris@110 51 Window<double> w(type, N);
Chris@110 52 w.cut(d);
Chris@110 53 COMPARE_ARRAY(d, expected);
Chris@110 54 }
Chris@110 55
Chris@110 56 BOOST_AUTO_TEST_CASE(bartlett)
Chris@110 57 {
Chris@110 58 double e1[] = { 1 };
Chris@110 59 testWindow<1>(BartlettWindow, e1);
Chris@110 60
Chris@110 61 double e2[] = { 0, 0 };
Chris@110 62 testWindow<2>(BartlettWindow, e2);
Chris@110 63
Chris@110 64 double e3[] = { 0, 2./3., 2./3. };
Chris@110 65 testWindow<3>(BartlettWindow, e3);
Chris@110 66
Chris@110 67 double e4[] = { 0, 1./2., 1., 1./2. };
Chris@110 68 testWindow<4>(BartlettWindow, e4);
Chris@110 69
Chris@110 70 double e5[] = { 0, 1./2., 1., 1., 1./2. };
Chris@110 71 testWindow<5>(BartlettWindow, e5);
Chris@110 72
Chris@110 73 double e6[] = { 0, 1./3., 2./3., 1., 2./3., 1./3. };
Chris@110 74 testWindow<6>(BartlettWindow, e6);
Chris@110 75 }
Chris@110 76
Chris@110 77 BOOST_AUTO_TEST_CASE(hamming)
Chris@110 78 {
Chris@110 79 double e1[] = { 1 };
Chris@110 80 testWindow<1>(HammingWindow, e1);
Chris@110 81
Chris@110 82 double e10[] = {
Chris@110 83 0.0800, 0.1679, 0.3979, 0.6821, 0.9121,
Chris@110 84 1.0000, 0.9121, 0.6821, 0.3979, 0.1679
Chris@110 85 };
Chris@110 86 testWindow<10>(HammingWindow, e10);
Chris@110 87 }
Chris@110 88
Chris@110 89 BOOST_AUTO_TEST_CASE(hann)
Chris@110 90 {
Chris@110 91 double e1[] = { 1 };
Chris@110 92 testWindow<1>(HanningWindow, e1);
Chris@110 93
Chris@110 94 double e10[] = {
Chris@110 95 0, 0.0955, 0.3455, 0.6545, 0.9045,
Chris@110 96 1.0000, 0.9045, 0.6545, 0.3455, 0.0955,
Chris@110 97 };
Chris@110 98 testWindow<10>(HanningWindow, e10);
Chris@110 99 }
Chris@110 100
Chris@110 101 BOOST_AUTO_TEST_CASE(blackman)
Chris@110 102 {
Chris@110 103 double e1[] = { 1 };
Chris@110 104 testWindow<1>(BlackmanWindow, e1);
Chris@110 105
Chris@110 106 double e10[] = {
Chris@110 107 0, 0.0402, 0.2008, 0.5098, 0.8492,
Chris@110 108 1.0000, 0.8492, 0.5098, 0.2008, 0.0402,
Chris@110 109 };
Chris@110 110 testWindow<10>(BlackmanWindow, e10);
Chris@110 111 }
Chris@110 112
Chris@110 113 BOOST_AUTO_TEST_SUITE_END()
Chris@110 114