summaryrefslogtreecommitdiff
path: root/gr-fec/python/fec/bitflip.py
blob: a482152e547942e8a7c967b61eb9a806fd783e29 (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
69
70
71
72
#!/usr/bin/env python
#
# Copyright 2014 Free Software Foundation, Inc.
#
# This file is part of GNU Radio
#
# SPDX-License-Identifier: GPL-3.0-or-later
#
#


def bitreverse(mint):
    res = 0
    while mint != 0:
        res = res << 1
        res += mint & 1
        mint = mint >> 1
    return res


const_lut = [2]
specinvert_lut = [[0, 2, 1, 3]]


def bitflip(mint, bitflip_lut, index, csize):
    res = 0
    cnt = 0
    mask = (1 << const_lut[index]) - 1
    while (cnt < csize):
        res += (bitflip_lut[(mint >> cnt) & (mask)]) << cnt
        cnt += const_lut[index]
    return res


def read_bitlist(bitlist):
    res = 0
    for i in range(len(bitlist)):
        if int(bitlist[i]) == 1:
            res += 1 << (len(bitlist) - i - 1)
    return res


def read_big_bitlist(bitlist):
    ret = []
    for j in range(0, len(bitlist) / 64):
        res = 0
        for i in range(0, 64):
            if int(bitlist[j * 64 + i]) == 1:
                res += 1 << (64 - i - 1)
        ret.append(res)
    res = 0
    j = 0
    for i in range(len(bitlist) % 64):
        if int(bitlist[len(ret) * 64 + i]) == 1:
            res += 1 << (64 - j - 1)
        j += 1
    ret.append(res)
    return ret


def generate_symmetries(symlist):
    retlist = []
    if len(symlist) == 1:
        for i in range(len(symlist[0])):
            retlist.append(symlist[0][i:] + symlist[0][0:i])
        invlist = symlist[0]
        for i in range(1, len(symlist[0]) / 2):
            invlist[i] = symlist[0][i + len(symlist[0]) / 2]
            invlist[i + len(symlist[0]) / 2] = symlist[0][i]
        for i in range(len(symlist[0])):
            retlist.append(symlist[0][i:] + symlist[0][0:i])
        return retlist