c@335: 
c@335: #include "dsp/transforms/FFT.h"
c@335: 
c@335: #define BOOST_TEST_DYN_LINK
c@335: #define BOOST_TEST_MAIN
c@335: 
c@335: #include <boost/test/unit_test.hpp>
c@335: 
c@335: BOOST_AUTO_TEST_SUITE(TestFFT)
c@335: 
c@335: #define COMPARE_CONST(a, n) \
c@335:     for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
c@335:         BOOST_CHECK_SMALL(a[cmp_i] - n, 1e-14);				\
c@335:     }
c@335: 
c@335: #define COMPARE_ARRAY(a, b)						\
c@335:     for (int cmp_i = 0; cmp_i < (int)(sizeof(a)/sizeof(a[0])); ++cmp_i) { \
c@335:         BOOST_CHECK_SMALL(a[cmp_i] - b[cmp_i], 1e-14);			\
c@335:     }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(dc)
c@335: {
c@335:     // DC-only signal. The DC bin is purely real
c@335:     double in[] = { 1, 1, 1, 1 };
c@335:     double re[4], im[4];
c@335:     FFT(4).process(false, in, 0, re, im);
c@335:     BOOST_CHECK_EQUAL(re[0], 4.0);
c@335:     BOOST_CHECK_EQUAL(re[1], 0.0);
c@335:     BOOST_CHECK_EQUAL(re[2], 0.0);
c@335:     COMPARE_CONST(im, 0.0);
c@335:     double back[4];
c@335:     double backim[4];
c@335:     FFT(4).process(true, re, im, back, backim);
c@335:     COMPARE_ARRAY(back, in);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(sine)
c@335: {
c@335:     // Sine. Output is purely imaginary
c@335:     double in[] = { 0, 1, 0, -1 };
c@335:     double re[4], im[4];
c@335:     FFT(4).process(false, in, 0, re, im);
c@335:     COMPARE_CONST(re, 0.0);
c@335:     BOOST_CHECK_EQUAL(im[0], 0.0);
c@335:     BOOST_CHECK_EQUAL(im[1], -2.0);
c@335:     BOOST_CHECK_EQUAL(im[2], 0.0);
c@335:     double back[4];
c@335:     double backim[4];
c@335:     FFT(4).process(true, re, im, back, backim);
c@335:     COMPARE_ARRAY(back, in);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(cosine)
c@335: {
c@335:     // Cosine. Output is purely real
c@335:     double in[] = { 1, 0, -1, 0 };
c@335:     double re[4], im[4];
c@335:     FFT(4).process(false, in, 0, re, im);
c@335:     BOOST_CHECK_EQUAL(re[0], 0.0);
c@335:     BOOST_CHECK_EQUAL(re[1], 2.0);
c@335:     BOOST_CHECK_EQUAL(re[2], 0.0);
c@335:     COMPARE_CONST(im, 0.0);
c@335:     double back[4];
c@335:     double backim[4];
c@335:     FFT(4).process(true, re, im, back, backim);
c@335:     COMPARE_ARRAY(back, in);
c@335: }
c@335: 	
c@335: BOOST_AUTO_TEST_CASE(sineCosine)
c@335: {
c@335:     // Sine and cosine mixed
c@335:     double in[] = { 0.5, 1, -0.5, -1 };
c@335:     double re[4], im[4];
c@335:     FFT(4).process(false, in, 0, re, im);
c@335:     BOOST_CHECK_EQUAL(re[0], 0.0);
c@335:     BOOST_CHECK_CLOSE(re[1], 1.0, 1e-12);
c@335:     BOOST_CHECK_EQUAL(re[2], 0.0);
c@335:     BOOST_CHECK_EQUAL(im[0], 0.0);
c@335:     BOOST_CHECK_CLOSE(im[1], -2.0, 1e-12);
c@335:     BOOST_CHECK_EQUAL(im[2], 0.0);
c@335:     double back[4];
c@335:     double backim[4];
c@335:     FFT(4).process(true, re, im, back, backim);
c@335:     COMPARE_ARRAY(back, in);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(nyquist)
c@335: {
c@335:     double in[] = { 1, -1, 1, -1 };
c@335:     double re[4], im[4];
c@335:     FFT(4).process(false, in, 0, re, im);
c@335:     BOOST_CHECK_EQUAL(re[0], 0.0);
c@335:     BOOST_CHECK_EQUAL(re[1], 0.0);
c@335:     BOOST_CHECK_EQUAL(re[2], 4.0);
c@335:     COMPARE_CONST(im, 0.0);
c@335:     double back[4];
c@335:     double backim[4];
c@335:     FFT(4).process(true, re, im, back, backim);
c@335:     COMPARE_ARRAY(back, in);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(dirac)
c@335: {
c@335:     double in[] = { 1, 0, 0, 0 };
c@335:     double re[4], im[4];
c@335:     FFT(4).process(false, in, 0, re, im);
c@335:     BOOST_CHECK_EQUAL(re[0], 1.0);
c@335:     BOOST_CHECK_EQUAL(re[1], 1.0);
c@335:     BOOST_CHECK_EQUAL(re[2], 1.0);
c@335:     COMPARE_CONST(im, 0.0);
c@335:     double back[4];
c@335:     double backim[4];
c@335:     FFT(4).process(true, re, im, back, backim);
c@335:     COMPARE_ARRAY(back, in);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(forwardArrayBounds)
c@335: {
c@335:     // initialise bins to something recognisable, so we can tell
c@335:     // if they haven't been written
c@335:     double in[] = { 1, 1, -1, -1 };
c@335:     double re[] = { 999, 999, 999, 999, 999, 999 };
c@335:     double im[] = { 999, 999, 999, 999, 999, 999 };
c@335:     FFT(4).process(false, in, 0, re+1, im+1);
c@335:     // And check we haven't overrun the arrays
c@335:     BOOST_CHECK_EQUAL(re[0], 999.0);
c@335:     BOOST_CHECK_EQUAL(im[0], 999.0);
c@335:     BOOST_CHECK_EQUAL(re[5], 999.0);
c@335:     BOOST_CHECK_EQUAL(im[5], 999.0);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_CASE(inverseArrayBounds)
c@335: {
c@335:     // initialise bins to something recognisable, so we can tell
c@335:     // if they haven't been written
c@335:     double re[] = { 0, 1, 0 };
c@335:     double im[] = { 0, -2, 0 };
c@335:     double outre[] = { 999, 999, 999, 999, 999, 999 };
c@335:     double outim[] = { 999, 999, 999, 999, 999, 999 };
c@335:     FFT(4).process(false, re, im, outre+1, outim+1);
c@335:     // And check we haven't overrun the arrays
c@335:     BOOST_CHECK_EQUAL(outre[0], 999.0);
c@335:     BOOST_CHECK_EQUAL(outim[0], 999.0);
c@335:     BOOST_CHECK_EQUAL(outre[5], 999.0);
c@335:     BOOST_CHECK_EQUAL(outim[5], 999.0);
c@335: }
c@335: 
c@335: BOOST_AUTO_TEST_SUITE_END()
c@335: