aboutsummaryrefslogtreecommitdiffstats
path: root/gr-fft/lib/qa_fft_shift.cc
blob: d219ce0a66df1c4dd66f3cadebac20e8ec98e181 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/* -*- c++ -*- */
/*
 * Copyright 2019 Free Software Foundation, Inc.
 *
 * This file is part of GNU Radio
 *
 * GNU Radio is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 3, or (at your option)
 * any later version.
 *
 * GNU Radio is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with GNU Radio; see the file COPYING.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street,
 * Boston, MA 02110-1301, USA.
 */

#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 */