annotate tests/TestFFT.cpp @ 335:0a632ac70945

FFT and window tests
author Chris Cannam <c.cannam@qmul.ac.uk>
date Mon, 30 Sep 2013 16:50:38 +0100
parents
children f6ccde089491
rev   line source
c@335 1
c@335 2 #include "dsp/transforms/FFT.h"
c@335 3
c@335 4 #define BOOST_TEST_DYN_LINK
c@335 5 #define BOOST_TEST_MAIN
c@335 6
c@335 7 #include <boost/test/unit_test.hpp>
c@335 8
c@335 9 BOOST_AUTO_TEST_SUITE(TestFFT)
c@335 10
c@335 11 #define COMPARE_CONST(a, n) \
c@335 12 for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
c@335 13 BOOST_CHECK_SMALL(a[cmp_i] - n, 1e-14); \
c@335 14 }
c@335 15
c@335 16 #define COMPARE_ARRAY(a, b) \
c@335 17 for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
c@335 18 BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-14); \
c@335 19 }
c@335 20
c@335 21 BOOST_AUTO_TEST_CASE(dc)
c@335 22 {
c@335 23 // DC-only signal. The DC bin is purely real
c@335 24 double in[] = { 1, 1, 1, 1 };
c@335 25 double re[4], im[4];
c@335 26 FFT(4).process(false, in, 0, re, im);
c@335 27 BOOST_CHECK_EQUAL(re[0], 4.0);
c@335 28 BOOST_CHECK_EQUAL(re[1], 0.0);
c@335 29 BOOST_CHECK_EQUAL(re[2], 0.0);
c@335 30 COMPARE_CONST(im, 0.0);
c@335 31 double back[4];
c@335 32 double backim[4];
c@335 33 FFT(4).process(true, re, im, back, backim);
c@335 34 COMPARE_ARRAY(back, in);
c@335 35 }
c@335 36
c@335 37 BOOST_AUTO_TEST_CASE(sine)
c@335 38 {
c@335 39 // Sine. Output is purely imaginary
c@335 40 double in[] = { 0, 1, 0, -1 };
c@335 41 double re[4], im[4];
c@335 42 FFT(4).process(false, in, 0, re, im);
c@335 43 COMPARE_CONST(re, 0.0);
c@335 44 BOOST_CHECK_EQUAL(im[0], 0.0);
c@335 45 BOOST_CHECK_EQUAL(im[1], -2.0);
c@335 46 BOOST_CHECK_EQUAL(im[2], 0.0);
c@335 47 double back[4];
c@335 48 double backim[4];
c@335 49 FFT(4).process(true, re, im, back, backim);
c@335 50 COMPARE_ARRAY(back, in);
c@335 51 }
c@335 52
c@335 53 BOOST_AUTO_TEST_CASE(cosine)
c@335 54 {
c@335 55 // Cosine. Output is purely real
c@335 56 double in[] = { 1, 0, -1, 0 };
c@335 57 double re[4], im[4];
c@335 58 FFT(4).process(false, in, 0, re, im);
c@335 59 BOOST_CHECK_EQUAL(re[0], 0.0);
c@335 60 BOOST_CHECK_EQUAL(re[1], 2.0);
c@335 61 BOOST_CHECK_EQUAL(re[2], 0.0);
c@335 62 COMPARE_CONST(im, 0.0);
c@335 63 double back[4];
c@335 64 double backim[4];
c@335 65 FFT(4).process(true, re, im, back, backim);
c@335 66 COMPARE_ARRAY(back, in);
c@335 67 }
c@335 68
c@335 69 BOOST_AUTO_TEST_CASE(sineCosine)
c@335 70 {
c@335 71 // Sine and cosine mixed
c@335 72 double in[] = { 0.5, 1, -0.5, -1 };
c@335 73 double re[4], im[4];
c@335 74 FFT(4).process(false, in, 0, re, im);
c@335 75 BOOST_CHECK_EQUAL(re[0], 0.0);
c@335 76 BOOST_CHECK_CLOSE(re[1], 1.0, 1e-12);
c@335 77 BOOST_CHECK_EQUAL(re[2], 0.0);
c@335 78 BOOST_CHECK_EQUAL(im[0], 0.0);
c@335 79 BOOST_CHECK_CLOSE(im[1], -2.0, 1e-12);
c@335 80 BOOST_CHECK_EQUAL(im[2], 0.0);
c@335 81 double back[4];
c@335 82 double backim[4];
c@335 83 FFT(4).process(true, re, im, back, backim);
c@335 84 COMPARE_ARRAY(back, in);
c@335 85 }
c@335 86
c@335 87 BOOST_AUTO_TEST_CASE(nyquist)
c@335 88 {
c@335 89 double in[] = { 1, -1, 1, -1 };
c@335 90 double re[4], im[4];
c@335 91 FFT(4).process(false, in, 0, re, im);
c@335 92 BOOST_CHECK_EQUAL(re[0], 0.0);
c@335 93 BOOST_CHECK_EQUAL(re[1], 0.0);
c@335 94 BOOST_CHECK_EQUAL(re[2], 4.0);
c@335 95 COMPARE_CONST(im, 0.0);
c@335 96 double back[4];
c@335 97 double backim[4];
c@335 98 FFT(4).process(true, re, im, back, backim);
c@335 99 COMPARE_ARRAY(back, in);
c@335 100 }
c@335 101
c@335 102 BOOST_AUTO_TEST_CASE(dirac)
c@335 103 {
c@335 104 double in[] = { 1, 0, 0, 0 };
c@335 105 double re[4], im[4];
c@335 106 FFT(4).process(false, in, 0, re, im);
c@335 107 BOOST_CHECK_EQUAL(re[0], 1.0);
c@335 108 BOOST_CHECK_EQUAL(re[1], 1.0);
c@335 109 BOOST_CHECK_EQUAL(re[2], 1.0);
c@335 110 COMPARE_CONST(im, 0.0);
c@335 111 double back[4];
c@335 112 double backim[4];
c@335 113 FFT(4).process(true, re, im, back, backim);
c@335 114 COMPARE_ARRAY(back, in);
c@335 115 }
c@335 116
c@335 117 BOOST_AUTO_TEST_CASE(forwardArrayBounds)
c@335 118 {
c@335 119 // initialise bins to something recognisable, so we can tell
c@335 120 // if they haven't been written
c@335 121 double in[] = { 1, 1, -1, -1 };
c@335 122 double re[] = { 999, 999, 999, 999, 999, 999 };
c@335 123 double im[] = { 999, 999, 999, 999, 999, 999 };
c@335 124 FFT(4).process(false, in, 0, re+1, im+1);
c@335 125 // And check we haven't overrun the arrays
c@335 126 BOOST_CHECK_EQUAL(re[0], 999.0);
c@335 127 BOOST_CHECK_EQUAL(im[0], 999.0);
c@335 128 BOOST_CHECK_EQUAL(re[5], 999.0);
c@335 129 BOOST_CHECK_EQUAL(im[5], 999.0);
c@335 130 }
c@335 131
c@335 132 BOOST_AUTO_TEST_CASE(inverseArrayBounds)
c@335 133 {
c@335 134 // initialise bins to something recognisable, so we can tell
c@335 135 // if they haven't been written
c@335 136 double re[] = { 0, 1, 0 };
c@335 137 double im[] = { 0, -2, 0 };
c@335 138 double outre[] = { 999, 999, 999, 999, 999, 999 };
c@335 139 double outim[] = { 999, 999, 999, 999, 999, 999 };
c@335 140 FFT(4).process(false, re, im, outre+1, outim+1);
c@335 141 // And check we haven't overrun the arrays
c@335 142 BOOST_CHECK_EQUAL(outre[0], 999.0);
c@335 143 BOOST_CHECK_EQUAL(outim[0], 999.0);
c@335 144 BOOST_CHECK_EQUAL(outre[5], 999.0);
c@335 145 BOOST_CHECK_EQUAL(outim[5], 999.0);
c@335 146 }
c@335 147
c@335 148 BOOST_AUTO_TEST_SUITE_END()
c@335 149