Last active
December 6, 2017 21:11
-
-
Save lzakharov/31278ecb5159e7180f009c557e7a94a4 to your computer and use it in GitHub Desktop.
Алгоритм арифметического кодирования.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def float2bin(x, eps=1e-9): | |
res = '' | |
while x > eps: | |
x *= 2 | |
res += str(int(x)) | |
x -= int(x) | |
return res | |
def bin2float(x): | |
return sum(2 ** (-i - 1) for i, digit in enumerate(x) if digit == '1') | |
def find_code(a, b): | |
i = 0 | |
a += '0' * (len(b) - len(a)) | |
while a[i] == b[i]: | |
i += 1 | |
res = a[:i] + '0' | |
cnt = 0 | |
while a[i] == 1: | |
i += 1 | |
cnt += 1 | |
res += '1' * (cnt + 1) | |
return res | |
def coding(word, alphabet, p): | |
left, right = 0, 1 | |
for letter in word: | |
i = alphabet.index(letter) | |
left, right = (left + (right - left) * sum(p[:i]), | |
left + (right - left) * sum(p[: i + 1])) | |
return find_code(*map(float2bin, (left, right))) | |
def decoding(code, length, alphabet, p): | |
code = bin2float(code) | |
word = '' | |
left, right = 0, 1 | |
for _ in range(length): | |
for i, letter in enumerate(alphabet): | |
interval = (left + (right - left) * sum(p[:i]), | |
left + (right - left) * sum(p[:i + 1])) | |
if interval[0] <= code < interval[1]: | |
word += letter | |
code = (code - interval[0]) / (interval[1] - interval[0]) | |
break | |
return word | |
alphabet = 'abcd' | |
p = (3/4, 1/8, 1/16, 1/16) | |
word = 'caad' | |
code = coding(word, alphabet, p) | |
print(code) | |
print(decoding(code, len(word), alphabet, p)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment