view tests/TestResampler.cpp @ 501:12b5a9244bb0

Style fixes: avoid unsigned, fix formatting

/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */

#include "dsp/rateconversion/Resampler.h"

#include "base/Window.h"
#include "dsp/transforms/FFT.h"

#include <iostream>

#include <cmath>

#define BOOST_TEST_DYN_LINK
#define BOOST_TEST_MAIN

#include <boost/test/unit_test.hpp>

BOOST_AUTO_TEST_SUITE(TestResampler)

using std::cout;
using std::endl;
using std::vector;

void
testResamplerOneShot(int sourceRate,
                     int targetRate,
                     int n,
                     double *in,
                     int m,
                     double *expected,
                     int skip)
{
    vector<double> resampled = Resampler::resample(sourceRate, targetRate,
                                                   in, n);
    if (skip == 0) {
        BOOST_CHECK_EQUAL(resampled.size(), m);
    }
    for (int i = 0; i < m; ++i) {
        BOOST_CHECK_SMALL(resampled[i + skip] - expected[i], 1e-6);
    }
}

void
testResampler(int sourceRate,
              int targetRate,
              int n,
              double *in,
              int m,
              double *expected)
{
    // Here we provide the input in chunks (of varying size)

    Resampler r(sourceRate, targetRate);
    int latency = r.getLatency();

    int m1 = m + latency;
    int n1 = int((m1 * sourceRate) / targetRate);

    double *inPadded = new double[n1];
    double *outPadded = new double[m1];

    for (int i = 0; i < n1; ++i) {
        if (i < n) inPadded[i] = in[i];
        else inPadded[i] = 0.0;
    }
    
    for (int i = 0; i < m1; ++i) {
        outPadded[i] = -999.0;
    }

    int chunkSize = 1;
    int got = 0;
    int i = 0;

    while (true) {
        got += r.process(inPadded + i, outPadded + got, chunkSize);
        i = i + chunkSize;
        chunkSize = chunkSize + 1;
        if (i >= n1) {
            break;
        } else if (i + chunkSize >= n1) {
            chunkSize = n1 - i;
        } else if (chunkSize > 15) {
            chunkSize = 1;
        }
    }

    BOOST_CHECK_EQUAL(got, m1);

    for (int i = latency; i < m1; ++i) {
        BOOST_CHECK_SMALL(outPadded[i] - expected[i-latency], 1e-8);
    }

    delete[] outPadded;
    delete[] inPadded;
}

BOOST_AUTO_TEST_CASE(sameRateOneShot)
{
    double d[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
    testResamplerOneShot(4, 4, 10, d, 10, d, 0);
}

BOOST_AUTO_TEST_CASE(sameRate)
{
    double d[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
    testResampler(4, 4, 10, d, 10, d);
}

BOOST_AUTO_TEST_CASE(interpolatedMisc)
{
    // Interpolating any signal by N should give a signal in which
    // every Nth sample is the original signal
    double in[] = { 0, 0.1, -0.3, -0.4, -0.3, 0, 0.5, 0.2, 0.8, -0.1 };
    int n = sizeof(in)/sizeof(in[0]);
    for (int factor = 2; factor < 10; ++factor) {
        vector<double> out = Resampler::resample(6, 6 * factor, in, n);
        for (int i = 0; i < n; ++i) {
            BOOST_CHECK_SMALL(out[i * factor] - in[i], 1e-5);
        }
    }
}

BOOST_AUTO_TEST_CASE(interpolatedSine)
{
    // Interpolating a sinusoid should give us a sinusoid, once we've
    // dropped the first few samples
    double in[1000];
    double out[2000];
    for (int i = 0; i < 1000; ++i) {
        in[i] = sin(i * M_PI / 2.0);
    }
    for (int i = 0; i < 2000; ++i) {
        out[i] = sin(i * M_PI / 4.0);
    }
    testResamplerOneShot(8, 16, 1000, in, 200, out, 512);
}

BOOST_AUTO_TEST_CASE(decimatedSine)
{
    // Decimating a sinusoid should give us a sinusoid, once we've
    // dropped the first few samples
    double in[2000];
    double out[1000];
    for (int i = 0; i < 2000; ++i) {
        in[i] = sin(i * M_PI / 8.0);
    }
    for (int i = 0; i < 1000; ++i) {
        out[i] = sin(i * M_PI / 4.0);
    }
    testResamplerOneShot(16, 8, 2000, in, 200, out, 256);
}

double
measureSinFreq(const vector<double> &v, int rate, int countCycles)
{
    int n = v.size();
    int firstPeak = -1;
    int lastPeak = -1;
    int nPeaks = 0;
    // count +ve peaks
    for (int i = v.size()/4; i + 1 < n; ++i) {
        // allow some fuzz
        int x0 = int(10000 * v[i-1]);
        int x1 = int(10000 * v[i]);
        int x2 = int(10000 * v[i+1]);
        if (x1 > 0 && x1 > x0 && x1 >= x2) {
            if (firstPeak < 0) firstPeak = i;
            lastPeak = i;
            ++nPeaks;
            if (nPeaks == countCycles) break;
        }
    }
    int nCycles = nPeaks - 1;
    if (nCycles <= 0) return 0.0;
    double cycle = double(lastPeak - firstPeak) / nCycles;
//    cout << "lastPeak = " << lastPeak << ", firstPeak = " << firstPeak << ", dist = " << lastPeak - firstPeak << ", nCycles = " << nCycles << ", cycle = " << cycle << endl;
    return rate / cycle;
}

void
testSinFrequency(int freq,
                 int sourceRate,
                 int targetRate)
{
    // Resampling a sinusoid and then resampling back should give us a
    // sinusoid of the same frequency as we started with

    int nCycles = 500;

    int duration = int(nCycles * float(sourceRate) / float(freq));
//    cout << "freq = " << freq << ", sourceRate = " << sourceRate << ", targetRate = " << targetRate << ", duration = " << duration << endl;

    vector<double> in(duration, 0);
    for (int i = 0; i < duration; ++i) {
        in[i] = sin(i * M_PI * 2.0 * freq / sourceRate);
    }

    vector<double> out = Resampler::resample(sourceRate, targetRate,
                                             in.data(), in.size());

    vector<double> back = Resampler::resample(targetRate, sourceRate,
                                              out.data(), out.size());

    BOOST_CHECK_EQUAL(in.size(), back.size());

    double inFreq = measureSinFreq(in, sourceRate, nCycles / 2);
    double backFreq = measureSinFreq(back, sourceRate, nCycles / 2);
    
    BOOST_CHECK_SMALL(inFreq - backFreq, 1e-8);
}

// In each of the following we use a frequency that has an exact cycle
// length in samples at the lowest sample rate, so that we can easily
// rule out errors in measuring the cycle length after resampling. If
// the resampler gets its input or output rate wrong, that will show
// up no matter what the test signal's initial frequency is.

BOOST_AUTO_TEST_CASE(downUp2)
{
    testSinFrequency(441, 44100, 22050);
}

BOOST_AUTO_TEST_CASE(downUp5)
{
    testSinFrequency(300, 15000, 3000);
}

BOOST_AUTO_TEST_CASE(downUp16)
{
    testSinFrequency(300, 48000, 3000);
}

BOOST_AUTO_TEST_CASE(upDown2)
{
    testSinFrequency(441, 44100, 88200);
}

BOOST_AUTO_TEST_CASE(upDown5)
{
    testSinFrequency(300, 3000, 15000);
}

BOOST_AUTO_TEST_CASE(upDown16)
{
    testSinFrequency(300, 3000, 48000);
}

vector<double>
squareWave(int rate, double freq, int n)
{
    //!!! todo: hoist, test
    vector<double> v(n, 0.0);
    for (int h = 0; h < (rate/4)/freq; ++h) {
        double m = h * 2 + 1;
        double scale = 1.0 / m;
        for (int i = 0; i < n; ++i) {
            double s = scale * sin((i * 2.0 * M_PI * m * freq) / rate);
            v[i] += s;
        }
    }
    return v;
}

void
testSpectrum(int inrate, int outrate)
{
    // One second of a square wave
    int freq = 500;

    vector<double> square =
        squareWave(inrate, freq, inrate);

    vector<double> maybeSquare = 
        Resampler::resample(inrate, outrate, square.data(), square.size());

    BOOST_CHECK_EQUAL(maybeSquare.size(), outrate);

    Window<double>(HanningWindow, inrate).cut(square.data());
    Window<double>(HanningWindow, outrate).cut(maybeSquare.data());

    // forward magnitude with size inrate, outrate

    vector<double> inSpectrum(inrate, 0.0);
    FFTReal(inrate).forwardMagnitude(square.data(), inSpectrum.data());
    for (int i = 0; i < (int)inSpectrum.size(); ++i) {
        inSpectrum[i] /= inrate;
    }

    vector<double> outSpectrum(outrate, 0.0);
    FFTReal(outrate).forwardMagnitude(maybeSquare.data(), outSpectrum.data());
    for (int i = 0; i < (int)outSpectrum.size(); ++i) {
        outSpectrum[i] /= outrate;
    }

    // Don't compare bins any higher than 96% of Nyquist freq of lower sr
    int lengthOfInterest = (inrate < outrate ? inrate : outrate) / 2;
    lengthOfInterest = lengthOfInterest - (lengthOfInterest / 25);

    for (int i = 0; i < lengthOfInterest; ++i) {
        BOOST_CHECK_SMALL(inSpectrum[i] - outSpectrum[i], 1e-7);
    }
}
/*
BOOST_AUTO_TEST_CASE(spectrum)
{
    int rates[] = { 8000, 22050, 44100, 48000 };
    for (int i = 0; i < (int)(sizeof(rates)/sizeof(rates[0])); ++i) {
            for (int j = 0; j < (int)(sizeof(rates)/sizeof(rates[0])); ++j) {
            testSpectrum(rates[i], rates[j]);
        }
    }
}
*/
BOOST_AUTO_TEST_SUITE_END()