c@343: /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
c@335: 
c@335: #include "base/Window.h"
c@349: #include "base/KaiserWindow.h"
c@351: #include "base/SincWindow.h"
c@335: 
c@335: #include <iostream>
c@335: 
c@335: #define BOOST_TEST_DYN_LINK
c@335: #define BOOST_TEST_MAIN
c@335: 
c@335: #include <boost/test/unit_test.hpp>
c@335: 
c@335: BOOST_AUTO_TEST_SUITE(TestWindow)
c@335: 
c@335: using std::cout;
c@335: using std::endl;
c@335: 
c@335: #define COMPARE_ARRAY(a, b)						\
c@335:     for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
c@335:         BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-4);			\
c@335:     }
c@335: 
c@335: void
c@335: testSymmetric(double *d, int n)
c@335: {
c@335:     for (int i = 0; i <= n/2; ++i) {
c@335: 	BOOST_CHECK_CLOSE(d[i], d[n-i-1], 1e-10);
c@335:     }
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(periodic)
c@335: {
c@335:     // We can't actually test whether a function is periodic, given
c@335:     // only one cycle of it! But we can make sure that all but the
c@335:     // first sample is symmetric, which is what a symmetric window
c@335:     // becomes when generated in periodic mode
c@335:     double d[9];
c@335:     for (int n = 8; n <= 9; ++n) {
c@335: 	for (int wt = (int)FirstWindow; wt <= (int)LastWindow; ++wt) {
c@335: 	    for (int i = 0; i < n; ++i) d[i] = 1.0;
c@335: 	    Window<double> w((WindowType)wt, n);
c@335: 	    w.cut(d);
c@335: 	    testSymmetric(d + 1, n - 1);
c@335: 	}
c@335:     }
c@335: }
c@335: 
c@335: template <int N>
c@335: void testWindow(WindowType type, const double expected[N])
c@335: {
c@335:     double d[N];
c@335:     for (int i = 0; i < N; ++i) d[i] = 1.0;
c@335:     Window<double> w(type, N);
c@335:     w.cut(d);
c@335:     COMPARE_ARRAY(d, expected);
c@336: 
c@336:     double d0[N], d1[N];
c@336:     for (int i = 0; i < N; ++i) d0[i] = 0.5 + (1.0 / (N * 2)) * (i + 1);
c@336:     w.cut(d0, d1);
c@336:     for (int i = 0; i < N; ++i) {
c@336: 	BOOST_CHECK_SMALL(d1[i] - d0[i] * expected[i], 1e-4);
c@336:     }
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(bartlett)
c@335: {
c@335:     double e1[] = { 1 };
c@335:     testWindow<1>(BartlettWindow, e1);
c@335: 
c@335:     double e2[] = { 0, 0 };
c@335:     testWindow<2>(BartlettWindow, e2);
c@335: 
c@335:     double e3[] = { 0, 2./3., 2./3. };
c@335:     testWindow<3>(BartlettWindow, e3);
c@335: 
c@335:     double e4[] = { 0, 1./2., 1., 1./2. };
c@335:     testWindow<4>(BartlettWindow, e4);
c@335: 
c@335:     double e5[] = { 0, 1./2., 1., 1., 1./2. };
c@335:     testWindow<5>(BartlettWindow, e5);
c@335: 
c@335:     double e6[] = { 0, 1./3., 2./3., 1., 2./3., 1./3. };
c@335:     testWindow<6>(BartlettWindow, e6);
c@335: }
c@335:     
c@335: BOOST_AUTO_TEST_CASE(hamming)
c@335: {
c@335:     double e1[] = { 1 };
c@335:     testWindow<1>(HammingWindow, e1);
c@335: 
c@335:     double e10[] = {
c@335: 	0.0800, 0.1679, 0.3979, 0.6821, 0.9121,
c@335:         1.0000, 0.9121, 0.6821, 0.3979, 0.1679
c@335:     };
c@335:     testWindow<10>(HammingWindow, e10);
c@335: }
c@335:     
c@335: BOOST_AUTO_TEST_CASE(hann)
c@335: {
c@335:     double e1[] = { 1 };
c@335:     testWindow<1>(HanningWindow, e1);
c@335: 
c@335:     double e10[] = {
c@335:         0, 0.0955, 0.3455, 0.6545, 0.9045,
c@335:         1.0000, 0.9045, 0.6545, 0.3455, 0.0955,
c@335:     };
c@335:     testWindow<10>(HanningWindow, e10);
c@335: }
c@335:     
c@335: BOOST_AUTO_TEST_CASE(blackman)
c@335: {
c@335:     double e1[] = { 1 };
c@335:     testWindow<1>(BlackmanWindow, e1);
c@335: 
c@335:     double e10[] = {
c@335:         0, 0.0402, 0.2008, 0.5098, 0.8492,
c@335:         1.0000, 0.8492, 0.5098, 0.2008, 0.0402,
c@335:     };
c@335:     testWindow<10>(BlackmanWindow, e10);
c@335: }
c@349: 
c@349: BOOST_AUTO_TEST_CASE(kaiser_4_10)
c@349: {
c@349:     double d[10];
c@349:     for (int i = 0; i < 10; ++i) d[i] = 1.0;
c@349:     double e[] = { 
c@349:         0.0885, 0.2943, 0.5644, 0.8216, 0.9789,
c@349:         0.9789, 0.8216, 0.5644, 0.2943, 0.0885
c@349:     };
c@349:     KaiserWindow::Parameters p;
c@349:     p.length = 10;
c@349:     p.beta = 4;
c@349:     KaiserWindow k(p);
c@349:     k.cut(d);
c@349:     COMPARE_ARRAY(d, e);
c@349: }
c@335:     
c@349: BOOST_AUTO_TEST_CASE(kaiser_2p5_11)
c@349: {
c@349:     double d[11];
c@349:     for (int i = 0; i < 11; ++i) d[i] = 1.0;
c@349:     double e[] = { 
c@349:         0.3040, 0.5005, 0.6929, 0.8546, 0.9622,
c@349:         1.0000, 0.9622, 0.8546, 0.6929, 0.5005, 0.3040
c@349:     };
c@349:     KaiserWindow::Parameters p;
c@349:     p.length = 11;
c@349:     p.beta = 2.5;
c@349:     KaiserWindow k(p);
c@349:     k.cut(d);
c@349:     COMPARE_ARRAY(d, e);
c@349: }
c@349: 
c@349: //!!! todo: tests for kaiser with attenuation and bandwidth parameters
c@351: 
c@351: template <int N>
c@351: void testSinc(double p, const double expected[N])
c@351: {
c@351:     double d[N];
c@351:     for (int i = 0; i < N; ++i) d[i] = 1.0;
c@351:     SincWindow w(N, p);
c@351:     w.cut(d);
c@351:     COMPARE_ARRAY(d, expected);
c@351: 
c@351:     double d0[N], d1[N];
c@351:     for (int i = 0; i < N; ++i) d0[i] = 0.5 + (1.0 / (N * 2)) * (i + 1);
c@351:     w.cut(d0, d1);
c@351:     for (int i = 0; i < N; ++i) {
c@351: 	BOOST_CHECK_SMALL(d1[i] - d0[i] * expected[i], 1e-4);
c@351:     }
c@351: }
c@351: 
c@351: BOOST_AUTO_TEST_CASE(sinc)
c@351: {
c@351:     double e1[] = { 0, 0, 1, 0, 0 };
c@351:     testSinc<5>(1, e1);
c@351: 
c@351:     double e2[] = { 0, 0, 1, 0, 0 };
c@351:     testSinc<5>(2, e2);
c@351: 
c@351:     double e3[] = { -0.2122, 0.0, 0.6366, 1.0, 0.6366, 0, -0.2122 };
c@351:     testSinc<7>(4, e3);
c@351: 
c@351:     double e4[] = { -0.2122, 0, 0.6366, 1, 0.6366, 0 };
c@351:     testSinc<6>(4, e4);
c@351: }
c@349:         
c@335: BOOST_AUTO_TEST_SUITE_END()
c@335: