-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathkodelmelete_hf2.js
189 lines (156 loc) · 6.41 KB
/
kodelmelete_hf2.js
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
179
180
181
182
183
184
185
186
187
188
189
"use strict"
var mystring = "";
var a = 0;
var b = 0;
var c = 0;
var d = 0;
var e = 0;
for (var i = 0; i < 40; i++) {
var chID = Math.floor(Math.random() * 5);
switch(chID){
case 0: mystring += "a"; a++; break;
case 1: mystring += "b"; b++; break;
case 2: mystring += "c"; c++; break;
case 3: mystring += "d"; d++; break;
case 4: mystring += "e"; e++; break;
}
}
console.log("karaktersorozat: " + mystring);
console.log("karakterek darabszáma: ");
console.log("a: " + a);
console.log("b: " + b);
console.log("c: " + c);
console.log("d: " + d);
console.log("e: " + e);
console.log(" ");
var pa = a/(a+b+c+d+e);
var pb = b/(a+b+c+d+e);
var pc = c/(a+b+c+d+e);
var pd = d/(a+b+c+d+e);
var pe = e/(a+b+c+d+e);
console.log("Valószínűségi eloszlások");
console.log("p(a): " + pa);
console.log("p(b): " + pb);
console.log("p(c): " + pc);
console.log("p(d): " + pd);
console.log("p(e): " + pe);
console.log(" ");
console.log("Információmennyiségek: ");
console.log("I(a): " + Math.log2(1/(a/(a+b+c+d+e))));
console.log("I(b): " + Math.log2(1/(b/(a+b+c+d+e))));
console.log("I(c): " + Math.log2(1/(c/(a+b+c+d+e))));
console.log("I(d): " + Math.log2(1/(d/(a+b+c+d+e))));
console.log("I(e): " + Math.log2(1/(e/(a+b+c+d+e))));
console.log(" ");
console.log("H(x): " + (-1)*( Math.log2(1/(a/(a+b+c+d+e)))*a/(a+b+c+d+e) + Math.log2(1/(b/(a+b+c+d+e)))*b/(a+b+c+d+e) + Math.log2(1/(c/(a+b+c+d+e)))*c/(a+b+c+d+e) + Math.log2(1/(d/(a+b+c+d+e)))* d/(a+b+c+d+e) + Math.log2(1/(e/(a+b+c+d+e)))*e/(a+b+c+d+e)) );
var encodedString = "";
for (var i = 0; i < mystring.length; i++) {
switch(mystring[i]){
case "a": encodedString += "0"; break;
case "b": encodedString += "10"; break;
case "c": encodedString += "110"; break;
case "d": encodedString += "111"; break;
case "e": encodedString += "1110"; break;
}
}
console.log("karaktersorozat nem szinguláris kódolással: " + encodedString);
/************** II. beadandó **************/
console.log(" ");
console.info("------ Shannon-Fano kódolással -----");
console.log(" ");
var probabilityArray = [pa,pb,pc,pd,pe];
probabilityArray = probabilityArray.sort();
for (var i = 0; i < probabilityArray.length; i++) {
switch(probabilityArray[i]){
case pa: probabilityArray[i] = ["pa", pa]; break;
case pb: probabilityArray[i] = ["pb", pb]; break;
case pc: probabilityArray[i] = ["pc", pc]; break;
case pd: probabilityArray[i] = ["pd", pd]; break;
case pe: probabilityArray[i] = ["pe", pe]; break;
}
}
var shannonFanoEncode = ["00","01","10","110","111"];
var shannonFanoEncodeder = [];
console.log("karakter\tvalsége\t\tkódjele");
for (var i = 0; i < probabilityArray.length; i++) {
shannonFanoEncodeder.push([probabilityArray[i], shannonFanoEncode[i]])
console.log(probabilityArray[i][0].substring(1) + "\t\t\t" + probabilityArray[i][1] + "\t\t\t" + shannonFanoEncode[i]);
}
var shannonFanoEncodedString = "";
for (var i = 0; i < mystring.length; i++) {
switch(mystring[i]){
case probabilityArray[0][0].substring(1): shannonFanoEncodedString += shannonFanoEncodeder[0][1]; break;
case probabilityArray[1][0].substring(1): shannonFanoEncodedString += shannonFanoEncodeder[1][1]; break;
case probabilityArray[2][0].substring(1): shannonFanoEncodedString += shannonFanoEncodeder[2][1]; break;
case probabilityArray[3][0].substring(1): shannonFanoEncodedString += shannonFanoEncodeder[3][1]; break;
case probabilityArray[4][0].substring(1): shannonFanoEncodedString += shannonFanoEncodeder[4][1]; break;
}
}
console.log("karaktersorozat Shannon-Fano kódolással: " + shannonFanoEncodedString);
console.log(" ");
console.info("------ Gilbert-Moore kódolással -----");
console.log(" ");
/****************/
var gilbertMooreProbabilityArray = [pa,pb,pc,pd,pe];
console.log("[0,1] intervallum felosztása " + gilbertMooreProbabilityArray.length + " elemhez...");
function interval(s,e,c) {
this.start = s;
this.end = e;
this.code = c;
}
var b = new interval(0,0.5,"0");
var c = new interval(0.5,1,"1")
var intervalParts = [[b,c]];
var nrOfLeaf = 2;
var nrOfLevel = 1;
//init sliceing
while (nrOfLeaf < gilbertMooreProbabilityArray.length){
var newLevel = [];
var tmpIdx = 0;
for (var i = 0; tmpIdx < intervalParts[nrOfLevel-1].length*2; i++) {
newLevel[tmpIdx] = new interval(intervalParts[nrOfLevel-1][i].start, intervalParts[nrOfLevel-1][i].start + (intervalParts[nrOfLevel-1][i].end - intervalParts[nrOfLevel-1][i].start)/2, intervalParts[nrOfLevel-1][i].code.concat("0"));
tmpIdx++;
newLevel[tmpIdx] = new interval(intervalParts[nrOfLevel-1][i].start + (intervalParts[nrOfLevel-1][i].end - intervalParts[nrOfLevel-1][i].start)/2, intervalParts[nrOfLevel-1][i].end, intervalParts[nrOfLevel-1][i].code.concat("1"));
tmpIdx++;
}
nrOfLevel++;
nrOfLeaf = newLevel.length;
intervalParts.push(newLevel);
}
//get the code for each character
var gilbertMooreCodeArray = [];
var tmpProbabilityPartSum = 0;
console.log("valség : részösszeg -> hozzá tartozó kódrészlet");
for (var i = 0; i < gilbertMooreProbabilityArray.length; i++) {
var found = 0;
//var level = 0;
var level = nrOfLevel-1;
var code = "";
tmpProbabilityPartSum += gilbertMooreProbabilityArray[i];
//while(found == 0){
for (var node = 0; node < intervalParts[level].length; node++) {
if((tmpProbabilityPartSum <= intervalParts[level][node].end) && (tmpProbabilityPartSum >= intervalParts[level][node].start)){
/*if (level+1<nrOfLevel) {
level++;
}
else{ //leaf found*/
found = 1;
console.log(gilbertMooreProbabilityArray[i] + " : " + tmpProbabilityPartSum + " -> " + intervalParts[level][node].code);
gilbertMooreCodeArray[i] = intervalParts[level][node].code;
//}
}
}
//}
}
/***********************/
var gilbertMooreEncodedString = "";
for (var i = 0; i < mystring.length; i++) {
switch(mystring[i]){
case "a": gilbertMooreEncodedString += gilbertMooreCodeArray[0]; break;
case "b": gilbertMooreEncodedString += gilbertMooreCodeArray[1]; break;
case "c": gilbertMooreEncodedString += gilbertMooreCodeArray[2]; break;
case "d": gilbertMooreEncodedString += gilbertMooreCodeArray[3]; break;
case "e": gilbertMooreEncodedString += gilbertMooreCodeArray[4]; break;
}
}
console.log("karaktersorozat Gilbert-Moore kódolással: " + gilbertMooreEncodedString);