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
|
/* -*- c++ -*- */
/*
* Copyright 2015 Free Software Foundation, Inc.
*
* This 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.
*
* This software 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 this software; 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/io_signature.h>
#include "dvbt_bit_inner_interleaver_impl.h"
#include <stdio.h>
#define MAX_MODULATION_ORDER 6
#define INTERLEAVER_BLOCK_SIZE 126
namespace gr {
namespace dtv {
const int dvbt_bit_inner_interleaver_impl::d_bsize = INTERLEAVER_BLOCK_SIZE;
int
dvbt_bit_inner_interleaver_impl::H(int e, int w)
{
int rez = 0;
switch (e) {
case 0:
rez = w;
break;
case 1:
rez = (w + 63) % d_bsize;
break;
case 2:
rez = (w + 105) % d_bsize;
break;
case 3:
rez = (w + 42) % d_bsize;
break;
case 4:
rez = (w + 21) % d_bsize;
break;
case 5:
rez = (w + 84) % d_bsize;
break;
default:
break;
}
return rez;
}
dvbt_bit_inner_interleaver::sptr
dvbt_bit_inner_interleaver::make(int nsize, \
dvb_constellation_t constellation, dvbt_hierarchy_t hierarchy, dvbt_transmission_mode_t transmission)
{
return gnuradio::get_initial_sptr
(new dvbt_bit_inner_interleaver_impl(nsize, constellation, hierarchy, transmission));
}
/*
* The private constructor
*/
dvbt_bit_inner_interleaver_impl::dvbt_bit_inner_interleaver_impl(int nsize, dvb_constellation_t constellation, \
dvbt_hierarchy_t hierarchy, dvbt_transmission_mode_t transmission)
: block("dvbt_bit_inner_interleaver",
io_signature::make(1, 2, sizeof(unsigned char) * nsize),
io_signature::make(1, 1, sizeof (unsigned char) * nsize)),
config(constellation, hierarchy, gr::dtv::C1_2, gr::dtv::C1_2, gr::dtv::GI_1_32, transmission),
d_nsize(nsize),
d_hierarchy(hierarchy)
{
d_v = config.d_m;
d_hierarchy = config.d_hierarchy;
d_perm = (unsigned char *)new unsigned char[d_v * d_bsize];
if (d_perm == NULL) {
std::cout << "Cannot allocate memory for d_perm" << std::endl;
exit(1);
}
//Init permutation table (used for b[e][do])
for (int i = 0; i < d_bsize * d_v; i++) {
if (d_hierarchy == NH) {
d_perm[i] = ((i % d_v) / (d_v / 2)) + 2 * (i % (d_v / 2));
}
else {
d_perm[i] = (i % (d_v - 2)) / ((d_v - 2) / 2) + 2 * (i % ((d_v - 2) / 2)) + 2;
}
}
if (d_nsize % d_bsize) {
std::cout << "Error: Input size must be multiple of block size: " \
<< "nsize: " << d_nsize << "bsize: " << d_bsize << std::endl;
}
}
/*
* Our virtual destructor.
*/
dvbt_bit_inner_interleaver_impl::~dvbt_bit_inner_interleaver_impl()
{
delete [] d_perm;
}
void
dvbt_bit_inner_interleaver_impl::forecast (int noutput_items, gr_vector_int &ninput_items_required)
{
unsigned ninputs = ninput_items_required.size();
for (unsigned i = 0; i < ninputs; i++)
ninput_items_required[i] = noutput_items;
}
int
dvbt_bit_inner_interleaver_impl::general_work (int noutput_items,
gr_vector_int &ninput_items,
gr_vector_const_void_star &input_items,
gr_vector_void_star &output_items)
{
const unsigned char *inh = (const unsigned char *) input_items[0];
const unsigned char *inl = (const unsigned char *) input_items[1];
unsigned char *out = (unsigned char *) output_items[0];
int bmax = noutput_items * d_nsize / d_bsize;
// First index of d_b is Bit interleaver number
// Second index of d_b is the position inside the Bit interleaver
unsigned char d_b[MAX_MODULATION_ORDER][INTERLEAVER_BLOCK_SIZE];
for (int bcount = 0; bcount < bmax; bcount++) {
for (int i = 0; i < d_bsize; i++) {
if (d_hierarchy == NH) {
int c = inh[bcount * d_bsize + i];
// Create the demultiplexer
for (int k = 0; k < d_v; k++) {
d_b[d_perm[(d_v * i) + k]][i] = (c >> (d_v - k - 1)) & 1;
}
}
else {
int ch = inh[(bcount * d_bsize) + i];
int cl = inl[(bcount * d_bsize) + i];
// High priority input - first 2 streams
for (int k = 0; k < 2; k++) {
d_b[(d_v * i + k) % 2][(d_v * i + k) / 2] = (ch >> (1 - k)) & 1;
}
// Low priority input - (v - 2) streams
for (int k = 2; k < (d_v - 2); k++) {
d_b[d_perm[d_v * i + k]][(d_v * i + k) / (d_v - 2)] = (cl >> (d_v - k - 1)) & 1;
}
}
}
// Take one bit from each interleaver
// and format the output
for (int w = 0; w < d_bsize; w++) {
int val = 0;
for (int e = 0; e < d_v; e++) {
val = (val << 1) | d_b[e][H(e, w)];
}
out[(bcount * d_bsize) + w] = val;
}
}
// Tell runtime system how many input items we consumed on
// each input stream.
consume_each (noutput_items);
// Tell runtime system how many output items we produced.
return noutput_items;
}
} /* namespace dtv */
} /* namespace gr */
|
