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
|
/*
Copyright (C) 2005, 2006, 2007, 2008, 2009 Her Majesty the Queen in Right
of Canada (Communications Research Center Canada)
*/
/*
This file is part of CRC-DabMux.
CRC-DabMux 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.
CRC-DabMux 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 CRC-DabMux. If not, see <http://www.gnu.org/licenses/>.
*/
#include "Interleaver.h"
#include <string.h>
#ifdef _WIN32
# define bzero(a, b) memset((a), 0, (b))
#endif // _WIN32
Interleaver::Interleaver(unsigned short I, unsigned short M, bool reverse)
{
this->I = I;
this->M = M;
this->N = I * M;
this->memSize = (this->N * I) - 1;
this->mem = new char[memSize];
setReverse(reverse);
}
Interleaver::~Interleaver()
{
delete []mem;
}
void Interleaver::setReverse(bool state)
{
reverse = state;
reset();
}
void Interleaver::reset()
{
j = 0;
index = 0;
bzero(mem, memSize);
}
void Interleaver::encode(void* data, unsigned long size)
{
encode(data, data, size);
}
void Interleaver::encode(const void* inData, void* outData, unsigned long size)
{
const char* input = reinterpret_cast<const char *>(inData);
char* output = reinterpret_cast<char *>(outData);
unsigned long i;
if (reverse) {
for (i = 0; i < size; ++i) {
mem[(index + ((I - 1 - j) * N)) % memSize] = *input;
*output = mem[index];
++input;
++output;
if (++j == I) {
j = 0;
}
if (++index == memSize) {
index = 0;
}
}
} else {
for (i = 0; i < size; ++i) {
if (j) {
mem[(index + (j * N)) % memSize] = *input;
*output = mem[index];
} else {
*output = *input;
}
++input;
++output;
if (++j == I) {
j = 0;
}
if (++index == memSize) {
index = 0;
}
}
}
}
unsigned long Interleaver::sync(void* data, unsigned long size, char padding)
{
char* input = reinterpret_cast<char *>(data);
unsigned long index;
if (reverse) {
for (index = 0; index < size; ++index) {
mem[(index + ((I - 1 - j) * N)) % memSize] = padding;
*input = mem[index];
++input;
if (++index == memSize) {
index = 0;
}
if (++j == I) {
j = 0;
break;
}
}
} else {
for (index = 0; index < size; ++index) {
mem[(index + (j * N)) % memSize] = padding;
*input = mem[index];
++input;
if (++index == memSize) {
index = 0;
}
if (++j == I) {
j = 0;
break;
}
}
}
return index;
}
|
