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
|
/*
Copyright (C) 2007, 2008, 2009, 2010, 2011 Her Majesty the Queen in
Right of Canada (Communications Research Center Canada)
Copyright (C) 2017
Matthias P. Braendli, matthias.braendli@mpb.li
Andreas Steger, andreas.steger@digris.ch
http://opendigitalradio.org
This block implements a memoryless polynom for digital predistortion.
For better performance, multiplying is done in another thread, leading
to a pipeline delay of two calls to MemlessPoly::process
*/
/*
This file is part of ODR-DabMod.
ODR-DabMod 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 of the
License, or (at your option) any later version.
ODR-DabMod 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 ODR-DabMod. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma GCC optimize ("O3")
#include "MemlessPoly.h"
#include "PcDebug.h"
#include "Utils.h"
#include <stdio.h>
#include <stdexcept>
#include <future>
#include <array>
#include <iostream>
#include <fstream>
#include <memory>
using namespace std;
#define NUM_COEFS 5
MemlessPoly::MemlessPoly(const std::string& coefs_file, unsigned int num_threads) :
PipelinedModCodec(),
RemoteControllable("memlesspoly"),
m_num_threads(num_threads),
m_coefs(),
m_coefs_file(coefs_file),
m_coefs_mutex()
{
PDEBUG("MemlessPoly::MemlessPoly(%s) @ %p\n",
coefs_file.c_str(), this);
if (m_num_threads == 0) {
const unsigned int hw_concurrency = std::thread::hardware_concurrency();
etiLog.level(info) << "Polynomial Predistorter will use " <<
hw_concurrency << " threads (auto detected)";
}
else {
etiLog.level(info) << "Polynomial Predistorter will use " <<
m_num_threads << " threads (set in config file)";
}
RC_ADD_PARAMETER(ncoefs, "(Read-only) number of coefficients.");
RC_ADD_PARAMETER(coeffile, "Filename containing coefficients. When written to, the new file gets automatically loaded.");
load_coefficients(m_coefs_file);
start_pipeline_thread();
}
void MemlessPoly::load_coefficients(const std::string &coefFile)
{
std::vector<complexf> coefs;
std::ifstream coef_fstream(coefFile.c_str());
if (!coef_fstream) {
throw std::runtime_error("MemlessPoly: Could not open file with coefs!");
}
int n_coefs;
coef_fstream >> n_coefs;
if (n_coefs <= 0) {
throw std::runtime_error("MemlessPoly: coefs file has invalid format.");
}
else if (n_coefs != NUM_COEFS) {
throw std::runtime_error("MemlessPoly: invalid number of coefs: " +
std::to_string(n_coefs) + " expected " + std::to_string(NUM_COEFS));
}
etiLog.log(debug, "MemlessPoly: Reading %d coefs...", n_coefs);
coefs.resize(n_coefs);
for (int n = 0; n < n_coefs; n++) {
float a, b;
coef_fstream >> a;
coef_fstream >> b;
coefs[n] = complexf(a, b);
if (coef_fstream.eof()) {
etiLog.log(error, "MemlessPoly: file %s should contains %d coefs, "
"but EOF reached after %d coefs !",
coefFile.c_str(), n_coefs, n);
throw std::runtime_error("MemlessPoly: coefs file invalid !");
}
}
{
std::lock_guard<std::mutex> lock(m_coefs_mutex);
m_coefs = coefs;
}
}
/* The restrict keyword is C99, g++ and clang++ however support __restrict
* instead, and this allows the compiler to auto-vectorize the loop.
*/
static void apply_coeff(
const vector<complexf> &coefs,
const complexf *__restrict in, size_t start, size_t stop,
complexf *__restrict out)
{
for (size_t i = start; i < stop; i++) {
/* Implement
a0 + a1*x + a2*x^2 + a3*x^3 + a4*x^4 + a5*x^5;
with less multiplications:
a0 + x*(a1 + x*(a2 + x*(a3 + x*(a3 + x*(a4 + a5*x)))));
*/
/* Make sure to adapt NUM_COEFS when you change this */
#if 1
// Complex polynomial, all operations are on complex values.
// Usually this is the representation we use when speaking
// about the real-valued passband signal that the PA receives.
out[i] =
coefs[0] + in[i] *
( coefs[1] + in[i] *
( coefs[2] + in[i] *
( coefs[3] + in[i] *
( coefs[4] + in[i] *
( coefs[5] + in[i] )))));
#else
// Polynomial on the magnitude only. All but one multiplication are
// on real values. This is what is usually used in papers for the
// baseband representation of the signal.
const float mag = std::abs(in[i]);
out[i] = in[i] *
mag * (coefs[0] +
mag * (coefs[1] +
mag * (coefs[2] +
mag * (coefs[3] +
mag * (coefs[4] +
mag * coefs[5] )))));
#endif
}
}
int MemlessPoly::internal_process(Buffer* const dataIn, Buffer* dataOut)
{
dataOut->setLength(dataIn->getLength());
const complexf* in = reinterpret_cast<const complexf*>(dataIn->getData());
complexf* out = reinterpret_cast<complexf*>(dataOut->getData());
size_t sizeOut = dataOut->getLength() / sizeof(complexf);
{
std::lock_guard<std::mutex> lock(m_coefs_mutex);
const unsigned int hw_concurrency = std::thread::hardware_concurrency();
const unsigned int num_threads =
(m_num_threads > 0) ? m_num_threads : hw_concurrency;
if (num_threads) {
const size_t step = sizeOut / num_threads;
vector<future<void> > flags;
size_t start = 0;
for (size_t i = 0; i < num_threads - 1; i++) {
flags.push_back(async(launch::async, apply_coeff,
m_coefs, in, start, start + step, out));
start += step;
}
// Do the last in this thread
apply_coeff(m_coefs, in, start, sizeOut, out);
// Wait for completion of the tasks
for (auto& f : flags) {
f.get();
}
}
else {
apply_coeff(m_coefs, in, 0, sizeOut, out);
}
}
return dataOut->getLength();
}
void MemlessPoly::set_parameter(const string& parameter, const string& value)
{
stringstream ss(value);
ss.exceptions ( stringstream::failbit | stringstream::badbit );
if (parameter == "ncoefs") {
throw ParameterError("Parameter 'ncoefs' is read-only");
}
else if (parameter == "coeffile") {
try {
load_coefficients(value);
m_coefs_file = value;
}
catch (std::runtime_error &e) {
throw ParameterError(e.what());
}
}
else {
stringstream ss;
ss << "Parameter '" << parameter <<
"' is not exported by controllable " << get_rc_name();
throw ParameterError(ss.str());
}
}
const string MemlessPoly::get_parameter(const string& parameter) const
{
stringstream ss;
if (parameter == "ncoefs") {
ss << m_coefs.size();
}
else if (parameter == "coefFile") {
ss << m_coefs_file;
}
else {
ss << "Parameter '" << parameter <<
"' is not exported by controllable " << get_rc_name();
throw ParameterError(ss.str());
}
return ss.str();
}
|