-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathbinradix_arithmetic_coding.pl
executable file
·178 lines (135 loc) · 4.24 KB
/
binradix_arithmetic_coding.pl
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
#!/usr/bin/perl
# Daniel "Trizen" Șuteu
# Date: 07 May 2015
# https://github.com/trizen
# The arithmetic coding algorithm (radix+binary).
# See also:
# https://en.wikipedia.org/wiki/Arithmetic_coding#Arithmetic_coding_as_a_generalized_change_of_radix
use 5.010;
use strict;
use warnings;
use Math::BigInt (try => 'GMP');
use Math::BigRat (try => 'GMP');
sub asciibet {
map { chr } 0 .. 255;
}
sub cumulative_freq {
my ($freq) = @_;
my %cf;
my $total = Math::BigInt->new(0);
foreach my $c (asciibet()) {
if (exists $freq->{$c}) {
$cf{$c} = $total;
$total += $freq->{$c};
}
}
return %cf;
}
sub arithmethic_coding {
my ($str) = @_;
my @chars = split(//, $str);
# The frequency characters
my %freq;
$freq{$_}++ for @chars;
# The cumulative frequency table
my %cf = cumulative_freq(\%freq);
# Limit and base
my $base = scalar @chars;
# Lower bound
my $L = Math::BigInt->new(0);
# Product of all frequencies
my $pf = Math::BigInt->new(1);
# Each term is multiplied by the product of the
# frequencies of all previously occurring symbols
foreach my $c (@chars) {
$L->bmuladd($base, $cf{$c} * $pf);
$pf->bmul($freq{$c});
}
# Upper bound
my $U = $L + $pf;
my $len = $L->length;
$L = Math::BigRat->new("$L / " . Math::BigInt->new(10)->bpow($len));
$U = Math::BigRat->new("$U / " . Math::BigInt->new(10)->bpow($len));
my $big_two = Math::BigInt->new(2);
my $two_pow = Math::BigInt->new(1);
my $n = Math::BigRat->new(0);
my $bin = '';
while ($n < $L || $n >= $U) {
my $m = Math::BigRat->new(1)->bdiv($two_pow->bmul($big_two));
if ($n + $m < $U) {
$n += $m;
$bin .= '1';
}
else {
$bin .= '0';
}
}
#~ say $L;
#~ say $U;
return ($bin, $len, \%freq);
}
sub arithmethic_decoding {
my ($enc, $pow, $freq) = @_;
my $two_pow = Math::BigInt->new(1);
my $big_two = Math::BigInt->new(2);
my $line = Math::BigRat->new(0);
my @bin = split(//, $enc);
foreach my $i (0 .. $#bin) {
$line->badd(scalar Math::BigRat->new($bin[$i])->bdiv($two_pow->bmul($big_two)));
}
$enc = $line->bmul(Math::BigInt->new(10)->bpow($pow))->as_int;
my $base = Math::BigInt->new(0);
$base += $_ for values %{$freq};
# Create the cumulative frequency table
my %cf = cumulative_freq($freq);
# Create the dictionary
my %dict;
while (my ($k, $v) = each %cf) {
$dict{$v} = $k;
}
# Fill the gaps in the dictionary
my $lchar;
foreach my $i (0 .. $base - 1) {
if (exists $dict{$i}) {
$lchar = $dict{$i};
}
elsif (defined $lchar) {
$dict{$i} = $lchar;
}
}
# Decode the input number
my $decoded = '';
for (my $i = $base - 1 ; $i >= 0 ; $i--) {
my $pow = $base**$i;
my $div = ($enc / $pow);
my $c = $dict{$div};
my $fv = $freq->{$c};
my $cv = $cf{$c};
my $rem = ($enc - $pow * $cv) / $fv;
#~ say "$enc / $base^$i = $div ($c)";
#~ say "($enc - $base^$i * $cv) / $fv = $rem\n";
$enc = $rem;
$decoded .= $c;
}
# Return the decoded output
return $decoded;
}
#
## Run some tests
#
foreach my $str (
qw(DABDDB DABDDBBDDBA ABBDDD ABRACADABRA CoMpReSSeD Sidef Trizen google TOBEORNOTTOBEORTOBEORNOT),
'In a positional numeral system the radix, or base, is numerically equal to a number of different symbols '
. 'used to express the number. For example, in the decimal system the number of symbols is 10, namely 0, 1, 2, '
. '3, 4, 5, 6, 7, 8, and 9. The radix is used to express any finite integer in a presumed multiplier in polynomial '
. 'form. For example, the number 457 is actually 4×102 + 5×101 + 7×100, where base 10 is presumed but not shown explicitly.'
) {
my ($enc, $pow, $freq) = arithmethic_coding($str);
my $dec = arithmethic_decoding($enc, $pow, $freq);
say "Encoded: $enc";
say "Decoded: $dec";
if ($str ne $dec) {
die "\tHowever that is incorrect!";
}
say "-" x 80;
}