This repository has been archived by the owner on Dec 3, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 73
/
bit_coding.py
executable file
·97 lines (88 loc) · 2.36 KB
/
bit_coding.py
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
#!/usr/bin/env python
#
# Copyright 2013 Jared Boone
#
# This file is part of the TPMS project.
#
# This program 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 2, or (at your option)
# any later version.
#
# This program 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 this program; see the file COPYING. If not, write to
# the Free Software Foundation, Inc., 51 Franklin Street,
# Boston, MA 02110-1301, USA.
#
# import numpy
# def copy_truncated(a, mod_n):
# return a[:(len(a) / mod_n) * mod_n].copy()
# def differential_manchester_decode(a):
# last_bit = 0
# a = copy_truncated(a, 2)
# a = a.reshape((-1, 2))
# result = []
# for pair in a:
# if pair[0] == pair[1]:
# result.append('X')
# elif last_bit != pair[0]:
# result.append('0')
# else:
# result.append('1')
# last_bit = pair[1]
# return result
# def biphase_decode(a):
# a = copy_truncated(a, 2)
# a = a.reshape((-1, 2))
# result = []
# for pair in a:
# if pair[0] != pair[1]:
# result.append('1')
# else:
# result.append('0')
# return result
# def manchester_decode(a):
# a = copy_truncated(a, 2)
# a = a.reshape((-1, 2))
# result = []
# for pair in a:
# if pair[0] == pair[1]:
# result.append('X')
# else:
# result.append(str(pair[1]))
# return result
def string_to_symbols(s, symbol_length):
return [s[n:n+symbol_length] for n in range(0, len(s), symbol_length)]
def differential_manchester_decode(s):
symbols = string_to_symbols(s, 2)
last_bit = '0'
result = []
for symbol in symbols:
if len(symbol) == 2:
if symbol[0] == symbol[1]:
result.append('X')
elif last_bit != symbol[0]:
result.append('0')
else:
result.append('1')
last_bit = symbol[1]
else:
result.append('X')
return ''.join(result)
def manchester_decode(s):
symbols = string_to_symbols(s, 2)
result = []
for symbol in symbols:
if len(symbol) == 2:
if symbol[0] == symbol[1]:
result.append('X')
else:
result.append(symbol[1])
else:
result.append('X')
return ''.join(result)