-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathlinecodes.py
More file actions
147 lines (101 loc) · 3.33 KB
/
Copy pathlinecodes.py
File metadata and controls
147 lines (101 loc) · 3.33 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
def generate_ami_b8zs_base(binary_list, init_cond, is_b8zs, is_pseudoternary=False):
last = 1 if init_cond else -1
zeroes = 0
result = []
for bit in binary_list:
if bool(bit) is not is_pseudoternary:
zeroes = 0
last = -last
code_value = last
else:
zeroes += 1
code_value = 0
result.append(code_value)
if is_b8zs and zeroes == 8:
result[-5] = result[-1] = last
result[-4] = result[-2] = -last
zeroes = 0
return result
def generate_ami(binary_list, init_cond):
return generate_ami_b8zs_base(binary_list, init_cond, False)
def generate_machester_differential(binary_list, init_cond):
result = [int(init_cond)]
for bit in binary_list:
result.append(result[-1] if bit else (result[-1] + 1) % 2)
result.append(0 if result[-1] else 1)
return result[1:]
def generate_manchester(binary_list, _):
result = []
for bit in binary_list:
result.append(0 if bit else 1)
result.append(bit)
return result
def generate_nrz_polar_l(binary_list, _):
return [-1 if bit else 1 for bit in binary_list] #NRZ-L
def generate_nrz_unipolar(binary_list, _):
return binary_list
def generate_nrz_polar_i(binary_list, init_cond):
result = [int(init_cond)]
for bit in binary_list:
result.append(result[-1] if not bit else (result[-1] + 1) % 2)
return result[1:]
def generate_nrz_4b5b(binary_list, _):
dicionary = {
"0000" : [1, 1, 1, 1, 0],
"0001" : [0, 1, 0, 0, 1],
"0010" : [1, 0, 1, 0, 0],
"0011" : [1, 0, 1, 0, 1],
"0100" : [0, 1, 0, 1, 0],
"0101" : [0, 1, 0, 1, 1],
"0110" : [0, 1, 1, 1, 0],
"0111" : [0, 1, 1, 1, 1],
"1000" : [1, 0, 0, 1, 0],
"1001" : [1, 0, 0, 1, 1],
"1010" : [1, 0, 1, 1, 0],
"1011" : [1, 0, 1, 1, 1],
"1100" : [1, 1, 0, 1, 0],
"1101" : [1, 1, 0, 1, 1],
"1110" : [1, 1, 1, 0, 0],
"1111" : [1, 1, 1, 0, 1]
}
str_list = ''.join(str(bit) for bit in binary_list)
result = []
for i in range(0, len(str_list), 4):
result += dicionary[str_list[i: i + 4]]
return result
def generate_rz(binary_list, _):
result = [0]*len(binary_list)*2
for i, val in enumerate(binary_list):
result[2*i] = 1 if val else -1
return result
def generate_b8zs(binary_list, init_cond):
return generate_ami_b8zs_base(binary_list, init_cond, True)
def generate_2b1q(binary_list, _):
result = []
for i in range(0, len(binary_list)-1, 2):
result.append(1 if binary_list[i] else -1)
if binary_list[i+1] == 0:
result[-1] *= 3
return result
def generate_mlt3(binary_list, init_cond):
growing = (init_cond == 1)
if init_cond == 0:
last = 1
elif init_cond == 3:
last = -1
else:
last = 0
result = []
for bit in binary_list:
if bit:
if growing:
last += 1
else:
last -= 1
if last > 1 or last < -1:
last = 0
growing = not growing
result.append(last)
return result
def generate_pseudoternary(binary_list, init_cond):
return generate_ami_b8zs_base(binary_list, init_cond, False, True)