香农编码C++分布实现
编码步骤
香农编码的步骤如下:
(1)将信源符号按其出现概率从大到小排序;
(2)计算出各概率对应的码字长度;
(3)计算累加概率;
(4)把各个累加概率由十进制转化为二进制,取该二进制数的前Ni位作为对应信源符号的码字。
具体实现
1.对信源符号按照概率从大到小排序
void f1(Shannon *S, int n)//对信源符号进行排序;
{
int i, j;
Shannon q;
for(i=0;i<n-1;i++)
for (j = n - 1;j > 0;j--)
if (S[j].P > S[j - 1].P)
{
q = S[j];S[j] = S[j - 1];S[j - 1] = q;
}
}
2.求码长
码长公式如下
void f2(Shannon* S, int n)//求码长;
{
int i;
double x;
for (i = 0;i < n;i++)
{
x = -(log(S[i].P) / log(2));
S[i].l = (int)x + 1;
}
}
3.求累加概率
void f3(Shannon* S, int n)//求累加概率;
{
int i;int j;double x;
S[0].pi = 0;
for (i = 1;i < n;i++)
{
x = 0;
for (j = 0;j < i;j++)
{
x = x + S[j].P;
}
S[i].pi = x;
}
}
4.求码字
void f4(Shannon s)//求码字;
{
int i;double x = s.pi;
for (i = 0;i < s.l;i++)
{
x = x * 2;
cout << (int)x;
x = x - (int)x;
}
}
5.求平均码长
double f5(Shannon* s, int n)//求平均码长;
{
double l = 0;
int i;
for (i = 0;i < n;i++)
l = l + s[i].l * s[i].P;
return l;
}
6.求编码效率
```javascript
double f6(Shannon* s, int n, double L)//编码效率
{
double H = 0, M = 0;
int i;
for (i = 0;i < n;i++)
H += s[i].P * (log(s[i].P) / log((float)2));
H = (-1) * H;
M = H / L;
return M;
}
程序本体
#include<iostream>
#include<cmath>
using namespace std;
class Shannon
{
public:
int name;
double P;//概率
int l;//码长
double pi;//累加概率
};
void f1(Shannon *S, int n)//对信源符号进行排序;
{
int i, j;
Shannon q;
for(i=0;i<n-1;i++)
for (j = n - 1;j > 0;j--)
if (S[j].P > S[j - 1].P)
{
q = S[j];S[j] = S[j - 1];S[j - 1] = q;
}
}
void f2(Shannon* S, int n)//求码长;
{
int i;
double x;
for (i = 0;i < n;i++)
{
x = -(log(S[i].P) / log(2));
S[i].l = (int)x + 1;
}
}
void f3(Shannon* S, int n)//求累加概率;
{
int i;int j;double x;
S[0].pi = 0;
for (i = 1;i < n;i++)
{
x = 0;
for (j = 0;j < i;j++)
{
x = x + S[j].P;
}
S[i].pi = x;
}
}
void f4(Shannon s)//求码字;
{
int i;double x = s.pi;
for (i = 0;i < s.l;i++)
{
x = x * 2;
cout << (int)x;
x = x - (int)x;
}
}
double f5(Shannon* s, int n)//求平均码长;
{
double l = 0;
int i;
for (i = 0;i < n;i++)
l = l + s[i].l * s[i].P;
return l;
}
double f6(Shannon* s, int n, double L)//编码效率
{
double H = 0, M = 0;
int i;
for (i = 0;i < n;i++)
H += s[i].P * (log(s[i].P) / log((float)2));
H = (-1) * H;
M = H / L;
return M;
}
int main()
{
int i, n;
Shannon S[20];
double L;
cout << "请输入信源符号个数:";
cin >> n;
cout << "请依次输入个信源概率";
for (i=0 ;i < n;i++)
{
S[i].name = i + 1;
cin >> S[i].P;
}//输入信源极其概率;
f1(S, n);
f2(S, n);
f3(S, n);
for (i = 0;i < n;i++)
{
cout << "符号U" << i + 1 << "信源符号码字为:";
f4(S[i]);
cout << endl;
}
L = f5(S, n);
cout << "平均码长为:" << L << endl;
cout << "编码效率" << f6(S, n, L) << endl;
return 0;
}
运行结果