annotate garage-resampler/TestResampler.cpp @ 5:8ed638d62713

Fix scaling on downsampling, another test
author Chris Cannam
date Mon, 14 Oct 2013 16:20:00 +0100
parents 1c3ab56ee9b5
children f55097c5d69f
rev   line source
Chris@0 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
Chris@0 2
Chris@0 3 #include "Resampler.h"
Chris@0 4
Chris@0 5 #include <iostream>
Chris@0 6
Chris@0 7 #include <cmath>
Chris@0 8
Chris@0 9 #define BOOST_TEST_DYN_LINK
Chris@0 10 #define BOOST_TEST_MAIN
Chris@0 11
Chris@0 12 #include <boost/test/unit_test.hpp>
Chris@0 13
Chris@0 14 BOOST_AUTO_TEST_SUITE(TestResampler)
Chris@0 15
Chris@0 16 using std::cout;
Chris@0 17 using std::endl;
Chris@1 18 using std::vector;
Chris@1 19
Chris@1 20 void
Chris@1 21 testResamplerOneShot(int sourceRate,
Chris@1 22 int targetRate,
Chris@1 23 int n,
Chris@1 24 double *in,
Chris@1 25 int m,
Chris@4 26 double *expected,
Chris@4 27 int skip)
Chris@1 28 {
Chris@1 29 vector<double> resampled = Resampler::resample(sourceRate, targetRate,
Chris@1 30 in, n);
Chris@4 31 if (skip == 0) {
Chris@4 32 BOOST_CHECK_EQUAL(resampled.size(), m);
Chris@4 33 }
Chris@1 34 for (int i = 0; i < m; ++i) {
Chris@4 35 BOOST_CHECK_SMALL(resampled[i + skip] - expected[i], 1e-8);
Chris@1 36 }
Chris@1 37 }
Chris@0 38
Chris@0 39 void
Chris@0 40 testResampler(int sourceRate,
Chris@0 41 int targetRate,
Chris@0 42 int n,
Chris@0 43 double *in,
Chris@0 44 int m,
Chris@0 45 double *expected)
Chris@0 46 {
Chris@2 47 // Here we provide the input in chunks (of varying size)
Chris@1 48
Chris@0 49 Resampler r(sourceRate, targetRate);
Chris@0 50 int latency = r.getLatency();
Chris@0 51
Chris@0 52 int m1 = m + latency;
Chris@0 53 int n1 = int((m1 * sourceRate) / targetRate);
Chris@0 54
Chris@0 55 double *inPadded = new double[n1];
Chris@0 56 double *outPadded = new double[m1];
Chris@0 57
Chris@0 58 for (int i = 0; i < n1; ++i) {
Chris@0 59 if (i < n) inPadded[i] = in[i];
Chris@0 60 else inPadded[i] = 0.0;
Chris@0 61 }
Chris@0 62
Chris@0 63 for (int i = 0; i < m1; ++i) {
Chris@0 64 outPadded[i] = -999.0;
Chris@0 65 }
Chris@0 66
Chris@2 67 int chunkSize = 1;
Chris@2 68 int got = 0;
Chris@2 69 int i = 0;
Chris@0 70
Chris@2 71 while (true) {
Chris@2 72 got += r.process(inPadded + i, outPadded + got, chunkSize);
Chris@2 73 i = i + chunkSize;
Chris@2 74 chunkSize = chunkSize + 1;
Chris@4 75 if (i >= n1) {
Chris@2 76 break;
Chris@2 77 } else if (i + chunkSize >= n1) {
Chris@2 78 chunkSize = n1 - i;
Chris@4 79 } else if (chunkSize > 15) {
Chris@4 80 chunkSize = 1;
Chris@2 81 }
Chris@2 82 }
Chris@2 83
Chris@4 84 BOOST_CHECK_EQUAL(got, m1);
Chris@0 85
Chris@0 86 for (int i = latency; i < m1; ++i) {
Chris@1 87 BOOST_CHECK_SMALL(outPadded[i] - expected[i-latency], 1e-8);
Chris@0 88 }
Chris@4 89
Chris@0 90 delete[] outPadded;
Chris@0 91 delete[] inPadded;
Chris@0 92 }
Chris@0 93
Chris@3 94 BOOST_AUTO_TEST_CASE(sameRateOneShot)
Chris@3 95 {
Chris@3 96 double d[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
Chris@4 97 testResamplerOneShot(4, 4, 10, d, 10, d, 0);
Chris@3 98 }
Chris@3 99
Chris@0 100 BOOST_AUTO_TEST_CASE(sameRate)
Chris@0 101 {
Chris@0 102 double d[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
Chris@0 103 testResampler(4, 4, 10, d, 10, d);
Chris@0 104 }
Chris@0 105
Chris@4 106 BOOST_AUTO_TEST_CASE(interpolatedMisc)
Chris@4 107 {
Chris@4 108 // Interpolating any signal by N should give a signal in which
Chris@4 109 // every Nth sample is the original signal
Chris@4 110 double in[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
Chris@4 111 int n = sizeof(in)/sizeof(in[0]);
Chris@4 112 for (int factor = 2; factor < 10; ++factor) {
Chris@4 113 vector<double> out = Resampler::resample(6, 6 * factor, in, n);
Chris@4 114 for (int i = 0; i < n; ++i) {
Chris@4 115 BOOST_CHECK_SMALL(out[i * factor] - in[i], 1e-5);
Chris@4 116 }
Chris@4 117 }
Chris@4 118 }
Chris@4 119
Chris@4 120 BOOST_AUTO_TEST_CASE(interpolatedSine)
Chris@4 121 {
Chris@5 122 // Interpolating a sinusoid should give us a sinusoid, once we've
Chris@5 123 // dropped the first few samples
Chris@4 124 double in[1000];
Chris@4 125 double out[2000];
Chris@4 126 for (int i = 0; i < 1000; ++i) {
Chris@4 127 in[i] = sin(i * M_PI / 2.0);
Chris@4 128 }
Chris@4 129 for (int i = 0; i < 2000; ++i) {
Chris@4 130 out[i] = sin(i * M_PI / 4.0);
Chris@4 131 }
Chris@5 132 testResamplerOneShot(8, 16, 1000, in, 200, out, 512);
Chris@5 133 }
Chris@5 134
Chris@5 135 BOOST_AUTO_TEST_CASE(decimatedSine)
Chris@5 136 {
Chris@5 137 // Decimating a sinusoid should give us a sinusoid, once we've
Chris@5 138 // dropped the first few samples
Chris@5 139 double in[2000];
Chris@5 140 double out[1000];
Chris@5 141 for (int i = 0; i < 2000; ++i) {
Chris@5 142 in[i] = sin(i * M_PI / 8.0);
Chris@5 143 }
Chris@5 144 for (int i = 0; i < 1000; ++i) {
Chris@5 145 out[i] = sin(i * M_PI / 4.0);
Chris@5 146 }
Chris@5 147 testResamplerOneShot(16, 8, 2000, in, 200, out, 256);
Chris@4 148 }
Chris@4 149
Chris@0 150 BOOST_AUTO_TEST_SUITE_END()
Chris@0 151