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