blob: a6939c24ec2107110944eaf9c6c2c3f7db6d2e0b (
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
|
/* -*- c++ -*- */
/*
* Copyright 2002,2012 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* SPDX-License-Identifier: GPL-3.0-or-later
*
*/
#include <gnuradio/trellis/base.h>
#include <cmath>
#include <cstdio>
#include <stdexcept>
namespace gr {
namespace trellis {
bool dec2base(unsigned int num, int base, std::vector<int>& s)
{
int l = s.size();
unsigned int n = num;
for (int i = 0; i < l; i++) {
s[l - i - 1] = n % base; // MSB first
n /= base;
}
if (n != 0) {
printf("Number %d requires more than %d digits.", num, l);
return false;
} else
return true;
}
unsigned int base2dec(const std::vector<int>& s, int base)
{
int l = s.size();
unsigned int num = 0;
for (int i = 0; i < l; i++)
num = num * base + s[i];
return num;
}
bool dec2bases(unsigned int num, const std::vector<int>& bases, std::vector<int>& s)
{
int l = s.size();
unsigned int n = num;
for (int i = 0; i < l; i++) {
s[l - i - 1] = n % bases[l - i - 1];
n /= bases[l - i - 1];
}
if (n != 0) {
printf("Number %d requires more than %d digits.", num, l);
return false;
} else
return true;
}
unsigned int bases2dec(const std::vector<int>& s, const std::vector<int>& bases)
{
int l = s.size();
unsigned int num = 0;
for (int i = 0; i < l; i++)
num = num * bases[i] + s[i];
return num;
}
} /* namespace trellis */
} /* namespace gr */
|