-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinterleave.c
More file actions
290 lines (239 loc) · 5.35 KB
/
interleave.c
File metadata and controls
290 lines (239 loc) · 5.35 KB
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
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
/*
* Copyright 2026 Corey Minyard
*
* SPDX-License-Identifier: Apache-2.0
*/
#include "interleave.h"
void
interleaver_init(struct interleaver *di,
unsigned int interleave,
uint8_t *data, unsigned int total_bits)
{
di->interleave = interleave;
di->total_bits = total_bits;
di->num_rows = total_bits / interleave;
di->data = data;
di->row = 0;
di->col = 0;
if (total_bits % interleave == 0) {
di->last_full_col = interleave;
} else {
di->last_full_col = total_bits % interleave - 1;
di->num_rows++;
}
}
static void
interleaver_calc_pos(struct interleaver *di,
unsigned int *byte, unsigned int *bit)
{
unsigned int bitpos = di->row * di->interleave + di->col;
*byte = bitpos / 8;
*bit = bitpos % 8;
}
static void
interleaver_next_bit(struct interleaver *di)
{
di->row++;
if (di->row >= di->num_rows) {
if (di->col == di->last_full_col)
/* Last bit that will go into the last byte. */
di->num_rows--;
di->col++;
di->row = 0;
}
}
void
interleave(unsigned int interleave,
uint8_t *data, unsigned int total_bits,
void (*output)(void *user_data, unsigned int bit),
void *user_data)
{
struct interleaver did, *di = &did;
unsigned int i;
interleaver_init(di, interleave, data, total_bits);
for (i = 0; i < total_bits; i++) {
unsigned int byte, bit;
interleaver_calc_pos(di, &byte, &bit);
output(user_data, (data[byte] >> bit) & 1);
interleaver_next_bit(di);
}
}
unsigned int
interleave_bit(struct interleaver *di)
{
unsigned int byte, bit;
unsigned int rv;
interleaver_calc_pos(di, &byte, &bit);
rv = (di->data[byte] >> bit) & 1;
interleaver_next_bit(di);
return rv;
}
void
deinterleave_bit(struct interleaver *di, unsigned int bitval)
{
unsigned int byte, bit;
interleaver_calc_pos(di, &byte, &bit);
di->data[byte] |= bitval << bit;
interleaver_next_bit(di);
}
#ifdef CONVCODE_TESTS
/*
* Test code.
*
* Compile and run with -t to run tests.
*
* To supply your own input and output, run as:
*
* ./interleave -t | <interleave> <bits>
*
* where bits is a sequence of 0 or 1.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <time.h>
static void
print_data(uint8_t *data, unsigned int nbits)
{
unsigned int i, byte, bit;
for (i = 0, byte = 0, bit = 0; i < nbits; i++) {
if (data[byte] & (1 << bit))
printf("1");
else
printf("0");
bit++;
if (bit >= 8) {
byte++;
bit = 0;
}
}
}
static uint8_t *
get_data(const char *input, unsigned int *rlen)
{
uint8_t *data;
unsigned int i, nbits, len, byte, bit;
len = strlen(input);
data = calloc(len, 1);
if (!data)
return data;
for (i = 0, byte = 0, bit = 0; input[i]; i++) {
if (input[i] == '1')
data[byte] |= 1 << bit;
nbits++;
bit++;
if (bit >= 8) {
byte++;
bit = 0;
}
}
*rlen = len;
return data;
}
static int
rand_test(void)
{
unsigned int len, i, interleave_len;
uint8_t *idata, *odata, *data;
struct interleaver di;
int rv = 0;
len = rand() % 256 + 1;
interleave_len = rand() % 32 + 1;
printf("Running test interleave size %u length %d\n", interleave_len, len);
data = calloc(len, 1);
idata = calloc(len / 8 + 1, 1);
odata = calloc(len / 8 + 1, 1);
for (i = 0; i < len; i++)
idata[i / 8] |= (rand() & 1) << (i % 8);
interleaver_init(&di, interleave_len, idata, len);
for (i = 0; i < len; i++)
data[i] = interleave_bit(&di);
interleaver_init(&di, interleave_len, odata, len);
for (i = 0; i < len; i++)
deinterleave_bit(&di, data[i]);
if (memcmp(idata, odata, len / 8 + 1) != 0) {
printf(" Failed\n");
rv = 1;
}
free(data);
free(idata);
free(odata);
return rv;
}
static int
run_tests(void)
{
int errs = 0, i;
srand(time(NULL));
for (i = 0; i < 32; i++)
errs += rand_test();
printf("%u errors\n", errs);
return !!errs;
}
static void
out_bit(void *user_data, unsigned int bit)
{
printf("%d", bit);
}
int
main(int argc, char *argv[])
{
unsigned int interleave_len;
uint8_t *data;
int arg;
unsigned int i, len;
bool decode = false, test = false;
for (arg = 1; arg < argc; arg++) {
if (argv[arg][0] != '-')
break;
if (strcmp(argv[arg], "-d") == 0) {
decode = true;
} else if (strcmp(argv[arg], "-e") == 0) {
decode = false;
} else if (strcmp(argv[arg], "-t") == 0) {
test = true;
} else {
fprintf(stderr, "unknown option: %s\n", argv[arg]);
return 1;
}
}
if (test)
return run_tests();
if (arg >= argc) {
fprintf(stderr, "No interleave size given\n");
return 1;
}
interleave_len = strtoul(argv[arg++], NULL, 0);
if (arg >= argc) {
fprintf(stderr, "No data given\n");
return 1;
}
if (decode) {
len = strlen(argv[arg]);
data = calloc(len, 1);
} else {
data = get_data(argv[arg], &len);
}
if (!data) {
printf("Unable to allocate data block\n");
return 1;
}
if (decode) {
struct interleaver di;
interleaver_init(&di, interleave_len, data, len);
for (i = 0; argv[arg][i]; i++) {
if (argv[arg][i] == '1')
deinterleave_bit(&di, 1);
else
deinterleave_bit(&di, 0);
}
print_data(data, len);
} else {
interleave(interleave_len, data, len, out_bit, NULL);
}
free(data);
printf("\n bits = %u\n", len);
return 0;
}
#endif