annotate garage-resampler/TestResampler.cpp @ 6:f55097c5d69f

Some fixes, and start on spectrum test
author Chris Cannam
date Tue, 15 Oct 2013 18:27:19 +0100
parents 8ed638d62713
children dfec65a1ca6b
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@6 5 #include "qm-dsp/base/Window.h"
Chris@6 6 #include "qm-dsp/dsp/transforms/FFT.h"
Chris@6 7
Chris@0 8 #include <iostream>
Chris@0 9
Chris@0 10 #include <cmath>
Chris@0 11
Chris@0 12 #define BOOST_TEST_DYN_LINK
Chris@0 13 #define BOOST_TEST_MAIN
Chris@0 14
Chris@0 15 #include <boost/test/unit_test.hpp>
Chris@0 16
Chris@0 17 BOOST_AUTO_TEST_SUITE(TestResampler)
Chris@0 18
Chris@0 19 using std::cout;
Chris@0 20 using std::endl;
Chris@1 21 using std::vector;
Chris@1 22
Chris@1 23 void
Chris@1 24 testResamplerOneShot(int sourceRate,
Chris@1 25 int targetRate,
Chris@1 26 int n,
Chris@1 27 double *in,
Chris@1 28 int m,
Chris@4 29 double *expected,
Chris@4 30 int skip)
Chris@1 31 {
Chris@1 32 vector<double> resampled = Resampler::resample(sourceRate, targetRate,
Chris@1 33 in, n);
Chris@4 34 if (skip == 0) {
Chris@4 35 BOOST_CHECK_EQUAL(resampled.size(), m);
Chris@4 36 }
Chris@1 37 for (int i = 0; i < m; ++i) {
Chris@4 38 BOOST_CHECK_SMALL(resampled[i + skip] - expected[i], 1e-8);
Chris@1 39 }
Chris@1 40 }
Chris@0 41
Chris@0 42 void
Chris@0 43 testResampler(int sourceRate,
Chris@0 44 int targetRate,
Chris@0 45 int n,
Chris@0 46 double *in,
Chris@0 47 int m,
Chris@0 48 double *expected)
Chris@0 49 {
Chris@2 50 // Here we provide the input in chunks (of varying size)
Chris@1 51
Chris@0 52 Resampler r(sourceRate, targetRate);
Chris@0 53 int latency = r.getLatency();
Chris@0 54
Chris@0 55 int m1 = m + latency;
Chris@0 56 int n1 = int((m1 * sourceRate) / targetRate);
Chris@0 57
Chris@0 58 double *inPadded = new double[n1];
Chris@0 59 double *outPadded = new double[m1];
Chris@0 60
Chris@0 61 for (int i = 0; i < n1; ++i) {
Chris@0 62 if (i < n) inPadded[i] = in[i];
Chris@0 63 else inPadded[i] = 0.0;
Chris@0 64 }
Chris@0 65
Chris@0 66 for (int i = 0; i < m1; ++i) {
Chris@0 67 outPadded[i] = -999.0;
Chris@0 68 }
Chris@0 69
Chris@2 70 int chunkSize = 1;
Chris@2 71 int got = 0;
Chris@2 72 int i = 0;
Chris@0 73
Chris@2 74 while (true) {
Chris@2 75 got += r.process(inPadded + i, outPadded + got, chunkSize);
Chris@2 76 i = i + chunkSize;
Chris@2 77 chunkSize = chunkSize + 1;
Chris@4 78 if (i >= n1) {
Chris@2 79 break;
Chris@2 80 } else if (i + chunkSize >= n1) {
Chris@2 81 chunkSize = n1 - i;
Chris@4 82 } else if (chunkSize > 15) {
Chris@4 83 chunkSize = 1;
Chris@2 84 }
Chris@2 85 }
Chris@2 86
Chris@4 87 BOOST_CHECK_EQUAL(got, m1);
Chris@0 88
Chris@0 89 for (int i = latency; i < m1; ++i) {
Chris@1 90 BOOST_CHECK_SMALL(outPadded[i] - expected[i-latency], 1e-8);
Chris@0 91 }
Chris@4 92
Chris@0 93 delete[] outPadded;
Chris@0 94 delete[] inPadded;
Chris@0 95 }
Chris@0 96
Chris@3 97 BOOST_AUTO_TEST_CASE(sameRateOneShot)
Chris@3 98 {
Chris@3 99 double d[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
Chris@4 100 testResamplerOneShot(4, 4, 10, d, 10, d, 0);
Chris@3 101 }
Chris@3 102
Chris@0 103 BOOST_AUTO_TEST_CASE(sameRate)
Chris@0 104 {
Chris@0 105 double d[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
Chris@0 106 testResampler(4, 4, 10, d, 10, d);
Chris@0 107 }
Chris@0 108
Chris@4 109 BOOST_AUTO_TEST_CASE(interpolatedMisc)
Chris@4 110 {
Chris@4 111 // Interpolating any signal by N should give a signal in which
Chris@4 112 // every Nth sample is the original signal
Chris@4 113 double in[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
Chris@4 114 int n = sizeof(in)/sizeof(in[0]);
Chris@4 115 for (int factor = 2; factor < 10; ++factor) {
Chris@4 116 vector<double> out = Resampler::resample(6, 6 * factor, in, n);
Chris@4 117 for (int i = 0; i < n; ++i) {
Chris@4 118 BOOST_CHECK_SMALL(out[i * factor] - in[i], 1e-5);
Chris@4 119 }
Chris@4 120 }
Chris@4 121 }
Chris@4 122
Chris@4 123 BOOST_AUTO_TEST_CASE(interpolatedSine)
Chris@4 124 {
Chris@5 125 // Interpolating a sinusoid should give us a sinusoid, once we've
Chris@5 126 // dropped the first few samples
Chris@4 127 double in[1000];
Chris@4 128 double out[2000];
Chris@4 129 for (int i = 0; i < 1000; ++i) {
Chris@4 130 in[i] = sin(i * M_PI / 2.0);
Chris@4 131 }
Chris@4 132 for (int i = 0; i < 2000; ++i) {
Chris@4 133 out[i] = sin(i * M_PI / 4.0);
Chris@4 134 }
Chris@5 135 testResamplerOneShot(8, 16, 1000, in, 200, out, 512);
Chris@5 136 }
Chris@5 137
Chris@5 138 BOOST_AUTO_TEST_CASE(decimatedSine)
Chris@5 139 {
Chris@5 140 // Decimating a sinusoid should give us a sinusoid, once we've
Chris@5 141 // dropped the first few samples
Chris@5 142 double in[2000];
Chris@5 143 double out[1000];
Chris@5 144 for (int i = 0; i < 2000; ++i) {
Chris@5 145 in[i] = sin(i * M_PI / 8.0);
Chris@5 146 }
Chris@5 147 for (int i = 0; i < 1000; ++i) {
Chris@5 148 out[i] = sin(i * M_PI / 4.0);
Chris@5 149 }
Chris@5 150 testResamplerOneShot(16, 8, 2000, in, 200, out, 256);
Chris@4 151 }
Chris@4 152
Chris@6 153 vector<double>
Chris@6 154 squareWave(int rate, int freq, int n)
Chris@6 155 {
Chris@6 156 //!!! todo: hoist, test
Chris@6 157 vector<double> v(n, 0.0);
Chris@6 158 for (int h = 0; h < (rate/4)/freq; ++h) {
Chris@6 159 double m = h * 2 + 1;
Chris@6 160 double scale = 1 / m;
Chris@6 161 for (int i = 0; i < n; ++i) {
Chris@6 162 v[i] += scale * sin(i * 2 * M_PI * freq / rate);
Chris@6 163 }
Chris@6 164 }
Chris@6 165 return v;
Chris@6 166 }
Chris@6 167
Chris@6 168 void
Chris@6 169 testSpectrum(int inrate, int outrate)
Chris@6 170 {
Chris@6 171 // One second of a square wave
Chris@6 172 int freq = 500;
Chris@6 173
Chris@6 174 std::cerr << "inrate = " << inrate << ", outrate = " << outrate << ", freq * outrate / inrate = " << (double(freq) * double(outrate)) / double(inrate) << std::endl;
Chris@6 175
Chris@6 176 std::cerr << "making square wave... ";
Chris@6 177 vector<double> square =
Chris@6 178 squareWave(inrate, freq, inrate);
Chris@6 179 std::cerr << "done" << std::endl;
Chris@6 180
Chris@6 181 vector<double> maybeSquare =
Chris@6 182 Resampler::resample(inrate, outrate, square.data(), square.size());
Chris@6 183
Chris@6 184 BOOST_CHECK_EQUAL(maybeSquare.size(), outrate);
Chris@6 185
Chris@6 186 Window<double>(HanningWindow, inrate).cut(square.data());
Chris@6 187 Window<double>(HanningWindow, outrate).cut(maybeSquare.data());
Chris@6 188
Chris@6 189 // forward magnitude with size inrate, outrate
Chris@6 190
Chris@6 191 vector<double> inSpectrum(inrate, 0.0);
Chris@6 192 FFTReal(inrate).forwardMagnitude(square.data(), inSpectrum.data());
Chris@6 193
Chris@6 194 vector<double> outSpectrum(outrate, 0.0);
Chris@6 195 FFTReal(outrate).forwardMagnitude(maybeSquare.data(), outSpectrum.data());
Chris@6 196
Chris@6 197 // Don't compare bins any higher than 99% of Nyquist freq of lower sr
Chris@6 198 int lengthOfInterest = (inrate < outrate ? inrate : outrate) / 2;
Chris@6 199 lengthOfInterest = lengthOfInterest - (lengthOfInterest / 100);
Chris@6 200
Chris@6 201 for (int i = 0; i < lengthOfInterest; ++i) {
Chris@6 202 BOOST_CHECK_SMALL(inSpectrum[i] - outSpectrum[i], 1e-7);
Chris@6 203 }
Chris@6 204 }
Chris@6 205
Chris@6 206 BOOST_AUTO_TEST_CASE(spectrum)
Chris@6 207 {
Chris@6 208 int rates[] = { 8000, 22050, 44100, 48000 };
Chris@6 209 for (int i = 0; i < sizeof(rates)/sizeof(rates[0]); ++i) {
Chris@6 210 for (int j = 0; j < sizeof(rates)/sizeof(rates[0]); ++j) {
Chris@6 211 testSpectrum(rates[i], rates[j]);
Chris@6 212 }
Chris@6 213 }
Chris@6 214 }
Chris@6 215
Chris@0 216 BOOST_AUTO_TEST_SUITE_END()
Chris@0 217