Ue&&se的实现逻辑
Ue是标准的指数哥伦布编码,Se是ue的变体.
ue的实现逻辑如下:
编码,其中,ue是要进行编码的原始值, len是编码长度, info是编码后的值.
void ue_linfo(int ue, int *len,int *info)
{
int i, nn =(ue + 1) >> 1;
for (i=0; i < 33 && nn != 0; i++)
{
nn >>= 1;
}
*len = (i << 1) + 1;
*info = ue + 1 - (1 << i);
}
解码: len是编码长度, info是编码后的值, value是解码后的值
void linfo_ue(int len, int info, int *value1)
{
//assert ((len >> 1) < 32);
*value1 = (int) (((unsigned int) 1 << (len >> 1)) + (unsigned int) (info) - 1);
}
可以看出来,编解码互为逆过程.
Se编解码的实现逻辑:
编码,se是要进行编码的原始值, len是编码长度, info是编码后的值.
void se_linfo(int se, int *len,int *info)
{
int sign = (se <= 0) ? 1 : 0;
int n = iabs(se) << 1; // n+1 is the number in the code table. Based on this we find length and info
int nn = (n >> 1);
int i;
for (i = 0; i < 33 && nn != 0; i++)
{
nn >>= 1;
}
*len = (i << 1) + 1;
*info = n - (1 << i) + sign;
}
解码,len是编码长度, info是编码后的值, value1是解码后的值.
void linfo_se(int len, int info, int *value1)
{
//assert ((len >> 1) < 32);
unsigned int n = ((unsigned int) 1 << (len >> 1)) + (unsigned int) info - 1;
*value1 = (n + 1) >> 1;
if((n & 0x01) == 0) // lsb is signed bit
*value1 = -*value1;
}
说明:
它与ue的区别在于把原始数值左移了一位,然后把info的最低位作为符号位.