qa_fft_shift.cc

/* -*- c++ -*- */
/*
 * Copyright 2019 Free Software Foundation, Inc.
 *
 * This file is part of GNU Radio
 *
 * SPDX-License-Identifier: GPL-3.0-or-later
 *
 */

#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include <gnuradio/fft/fft_shift.h>
#include <boost/test/unit_test.hpp>
#include <vector>

namespace gr {
namespace fft {

BOOST_AUTO_TEST_CASE(t1)
{
    fft::fft_shift<int> s(1023);

    std::vector<int> x_even{ 0, 1, 2, 3, -4, -3, -2, -1 };
    std::vector<int> y_even{ -4, -3, -2, -1, 0, 1, 2, 3 }; // expected result

    s.shift(x_even);
    if (x_even.size() == y_even.size()) {
        for (unsigned int i = 0; i < x_even.size(); i++) {
            BOOST_CHECK(x_even[i] == y_even[i]);
        }
    } else {
        BOOST_CHECK(x_even.size() == y_even.size());
    }

    // two shifts should not change the result
    s.shift(x_even);
    s.shift(x_even);
    if (x_even.size() == y_even.size()) {
        for (unsigned int i = 0; i < x_even.size(); i++) {
            BOOST_CHECK(x_even[i] == y_even[i]);
        }
    } else {
        BOOST_CHECK(x_even.size() == y_even.size());
    }
}

BOOST_AUTO_TEST_CASE(t2)
{
    fft::fft_shift<int> s(7);

    std::vector<int> x_odd{ 0, 1, 2, 3, -3, -2, -1 };
    std::vector<int> y_odd{ -3, -2, -1, 0, 1, 2, 3 }; // expected result

    s.shift(x_odd);
    if (x_odd.size() == y_odd.size()) {
        for (unsigned int i = 0; i < x_odd.size(); i++) {
            BOOST_CHECK(x_odd[i] == y_odd[i]);
        }
    } else {
        BOOST_CHECK(x_odd.size() == y_odd.size());
    }
}

} /* namespace fft */
} /* namespace gr */