群码Python实现及应用(CRC校验)

最新推荐文章于 2024-03-20 16:44:28 发布

zhiyunyao

最新推荐文章于 2024-03-20 16:44:28 发布

阅读量560

点赞数

分类专栏：离散数学文章标签： python

本文链接：https://blog.csdn.net/qq_43526642/article/details/105317405

版权

离散数学专栏收录该内容

1 篇文章 0 订阅

订阅专栏

群码Python实现及应用(CRC校验)

class Bn:

    def __init__(self, bits='0'):
        self._bits = bits

    def __getitem__(self, key):
        return Bn(self._bits[key])

    def __len__(self):
        return len(self._bits)

    def __str__(self):
        return self._bits

    def __xor__(self, other):
        return Bn(bin(int(self._bits, 2) ^ int(other._bits, 2))[2:])

    def __add__(self, other):
        return self ^ other

    def __iadd__(self, other):
        return self ^ other

    def __sub__(self, other):
        return self ^ other

    def __mul__(self, other):
        product = Bn()
        for i, ch in enumerate(reversed(other._bits)):
            if ch == '1':
                product += Bn(self._bits+'0'*i)
        return product

    def __truediv__(self, other):
        return divmod(self, other)[0]

    def __mod__(self, other):
        return divmod(self, other)[1]

    def __divmod__(self, other):
        ldividend = len(self)
        ld = len(other)
        if ldividend < ld:
            return Bn(), self

        i = ld
        dividend = self[:ld]
        quotient = ''
        while True:
            r = dividend ^ other
            deltal = ld-len(r)
            quotient += '1'
            if i+deltal > ldividend:
                break
            quotient += '0'*(deltal-1)
            dividend = Bn(r._bits+self._bits[i:i+deltal])
            i += deltal
        return Bn(quotient), r

def CRC(frame, generator):
    return Bn(frame+'0'*(len(generator)-1)) % Bn(generator)


print(Bn('10100001000') + Bn('1001'))
print(Bn('10100001000') - Bn('1001'))
print(Bn('10100001000') * Bn('1001'))
print(Bn('10100001000') / Bn('1001'))
print(Bn('10100001000') % Bn('1001'))
print('--------------')
print(CRC('10100001', '1001'))
print(CRC('11010110', '1001'))