annotate dsp/rateconversion/TestResampler.cpp @ 142:f8fc21365a8c

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