summaryrefslogtreecommitdiff
path: root/gr-digital/lib/decision_feedback_equalizer_impl.cc
blob: 323692628fd2ee24ae6d63b8fc6ee54e163fe157 (plain)
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
/* -*- c++ -*- */
/*
 * Copyright 2020 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 "adaptive_algorithms.h"
#include "decision_feedback_equalizer_impl.h"
#include <gnuradio/io_signature.h>
#include <volk/volk.h>
#include <boost/smart_ptr/make_unique.hpp>
#include <algorithm>

using namespace std;
namespace gr {
namespace digital {

decision_feedback_equalizer::sptr
decision_feedback_equalizer::make(unsigned num_taps_forward,
                                  unsigned num_taps_feedback,
                                  unsigned sps,
                                  adaptive_algorithm_sptr alg,
                                  bool adapt_after_training,
                                  std::vector<gr_complex> training_sequence,
                                  const std::string& training_start_tag)
{
    return gnuradio::make_block_sptr<decision_feedback_equalizer_impl>(
        num_taps_forward,
        num_taps_feedback,
        sps,
        alg,
        adapt_after_training,
        training_sequence,
        training_start_tag);
}

/*
 * The private constructor
 */
decision_feedback_equalizer_impl::decision_feedback_equalizer_impl(
    unsigned num_taps_forward,
    unsigned num_taps_feedback,
    unsigned sps,
    adaptive_algorithm_sptr alg,
    bool adapt_after_training,
    std::vector<gr_complex> training_sequence,
    const std::string& training_start_tag)
    : gr::sync_decimator("decision_feedback_equalizer",
                         io_signature::make(1, 1, sizeof(gr_complex)),
                         io_signature::makev(1,
                                             3,
                                             std::vector<int>{ sizeof(gr_complex),
                                                               (int)((num_taps_forward +
                                                                      num_taps_feedback) *
                                                                     sizeof(gr_complex)),
                                                               sizeof(unsigned short) }),
                         sps),
      filter::kernel::fir_filter_ccc(
          sps,
          vector<gr_complex>(num_taps_forward + num_taps_feedback, gr_complex(0, 0))),
      d_num_taps_fwd(num_taps_forward),
      d_num_taps_rev(num_taps_feedback),
      d_sps(sps),
      d_alg(alg),
      d_adapt_after_training(adapt_after_training),
      d_training_sequence(training_sequence),
      d_training_start_tag(pmt::intern(training_start_tag)),
      d_num_taps(num_taps_forward + num_taps_feedback),
      d_decision_history(num_taps_feedback),
      d_new_taps(num_taps_forward + num_taps_feedback),
      d_updated(false),
      d_training_sample(0),
      d_filt_buf(num_taps_forward + num_taps_feedback)
{
    // not reversed at this point
    d_new_taps[0] = gr_complex(1.0, 0.0); // help things along with initialized taps

    if (training_start_tag == "" || training_sequence.empty()) {
        d_training_state = equalizer_state_t::DD;
    } else {
        d_training_state = equalizer_state_t::IDLE;
    }

    set_history(d_num_taps_fwd);

    alg->initialize_taps(d_new_taps);
    // NOTE: the filter kernel reverses the taps internally
    filter::kernel::fir_filter_ccc::set_taps(d_new_taps);
}

void decision_feedback_equalizer_impl::update_decision_history(gr_complex decision)
{
    d_decision_history.pop_front();
    d_decision_history.push_back(decision);
}

int decision_feedback_equalizer_impl::work(int noutput_items,
                                           gr_vector_const_void_star& input_items,
                                           gr_vector_void_star& output_items)
{
    {
        gr::thread::scoped_lock guard(d_mutex);
        if (d_updated) {
            d_taps = d_new_taps;
            set_history(d_taps.size());
            d_updated = false;
            return 0; // history requirements may have changed.
        }
    }

    unsigned long int nread = nitems_read(0);
    vector<tag_t> tags;
    get_tags_in_window(tags, 0, 0, noutput_items * decimation(), d_training_start_tag);
    vector<unsigned int> training_start_samples(tags.size());
    unsigned int tag_index = 0;
    for (const auto& tag : tags) {
        training_start_samples[tag_index++] = tag.offset - nread;
    }

    auto in = static_cast<const gr_complex*>(input_items[0]);
    auto out = static_cast<gr_complex*>(output_items[0]);

    int outlen = output_items.size();
    unsigned short* state = nullptr;
    gr_complex* taps = nullptr;

    if (outlen > 1)
        taps = static_cast<gr_complex*>(output_items[1]);
    if (outlen > 2)
        state = static_cast<unsigned short*>(output_items[2]);

    return equalize(in,
                    out,
                    noutput_items * decimation(),
                    noutput_items,
                    training_start_samples,
                    true,
                    taps,
                    state);
}

void decision_feedback_equalizer_impl::set_taps(const vector<gr_complex>& taps)
{
    gr::thread::scoped_lock guard(d_mutex);
    d_new_taps = taps;
    d_updated = true;
}

vector<gr_complex> decision_feedback_equalizer_impl::taps() const
{
    gr::thread::scoped_lock guard(d_mutex);
    return d_taps;
}

int decision_feedback_equalizer_impl::equalize(
    const gr_complex* input_samples,
    gr_complex* output_symbols,
    unsigned int num_inputs,
    unsigned int max_num_outputs,
    std::vector<unsigned int> training_start_samples,
    bool history_included,
    gr_complex* taps,
    unsigned short* state)
{

    unsigned nout = num_inputs / d_sps;
    if (nout > max_num_outputs) {
        nout = max_num_outputs;
    }

    const gr_complex* samples;
    std::unique_ptr<std::vector<gr_complex>> in_prepended_history;
    if (history_included) {
        samples = input_samples;
    } else {
        in_prepended_history =
            boost::make_unique<std::vector<gr_complex>>(num_inputs + d_num_taps_fwd - 1);
        std::copy(input_samples,
                  input_samples + num_inputs,
                  in_prepended_history->begin() + d_num_taps_fwd - 1);
        samples = in_prepended_history->data();
    }

    unsigned int tag_index = 0;
    int j = 0; // pre-decimated input buffer index
    for (unsigned i = 0; i < nout; i++) {
        std::copy(&samples[j + d_sps - 1],
                  &samples[j + d_sps - 1] + d_num_taps_fwd,
                  d_filt_buf.begin() + d_num_taps_rev);
        std::copy(
            d_decision_history.begin(), d_decision_history.end(), d_filt_buf.data());

        output_symbols[i] = filter(d_filt_buf.data());

        if (taps) {
            std::copy(d_taps.begin(), d_taps.end(), taps + d_num_taps * i);
        }

        if (state)
            state[i] = (unsigned short)d_training_state;

        if (training_start_samples.size() > 0 &&
            tag_index < training_start_samples.size()) {
            int tag_sample = training_start_samples[tag_index];
            if (tag_sample >= j && tag_sample < (j + (int)decimation())) {
                d_training_state = equalizer_state_t::TRAINING;
                d_training_sample = 0;
                tag_index++;
            }
        }

        // Are we done with the training sequence
        if (d_training_sample >= d_training_sequence.size()) {
            if (d_adapt_after_training) {
                d_training_state = equalizer_state_t::DD;
            } else
                d_training_state = equalizer_state_t::IDLE;

            d_training_sample = -1;
        }

        gr_complex decision = gr_complex(0.0, 0.0);
        // Adjust taps
        if (d_training_state == equalizer_state_t::TRAINING) {
            decision = d_training_sequence[d_training_sample++];
            d_error = d_alg->error_tr(output_symbols[i], decision);
        } else if (d_training_state == equalizer_state_t::DD) {
            d_error =
                d_alg->error_dd(output_symbols[i], decision); // returns the decision
        }

        // update the decision history
        update_decision_history(decision);

        switch (d_training_state) {
        case equalizer_state_t::IDLE:
            d_error = gr_complex(0.0, 0.0);
            break;
        case equalizer_state_t::TRAINING:
        case equalizer_state_t::DD:
            d_alg->update_taps(
                &d_taps[0], d_filt_buf.data(), d_error, decision, d_taps.size());
            for (size_t k = 0; k < d_taps.size(); k++) {
                // Update aligned taps in filter object.
                filter::kernel::fir_filter_ccc::update_tap(d_taps[k], k);
            }

            break;
        }

        j += decimation();
    }

    return nout;
}

} // namespace digital
} // namespace gr