首页 | 本学科首页   官方微博 | 高级检索  
     

任意概率分布下Golomb码和扩展Gamma码的性能分析
引用本文:杨胜天,仇佩亮.任意概率分布下Golomb码和扩展Gamma码的性能分析[J].电子与信息学报,2005,27(4):514-518.
作者姓名:杨胜天  仇佩亮
作者单位:浙江大学信息与电子工程学系,杭州,310027;浙江大学信息与电子工程学系,杭州,310027
摘    要:以信源的平均值给出了任意概率分布下Golomb码的平均码长的上下界和最优的参数选择准则。在Golomb码的基础上,进一步推广了Elias的码,提出了扩展的码,同时给出了其性能界和最优的参数选择准则。扩展码是一类通用码,而且在一定的条件下可以达到渐近最优的性能。最后,提出了一个低复杂性的基于Golomb码和扩展码的通用数据压缩框架,并通过构建一个样例系统说明了该数据压缩框架的实际应用价值。

关 键 词:信源编码    整数编码    Golomb码    Elias    
文章编号:1009-5896(2005)04-0514-05
收稿时间:2003-9-18
修稿时间:2003年9月18日

Performance Analysis of Golomb Codes and Extended Gamma Codes for Arbitrary Probability Distributions
YANG Sheng-tian,QIU Pei-liang.Performance Analysis of Golomb Codes and Extended Gamma Codes for Arbitrary Probability Distributions[J].Journal of Electronics & Information Technology,2005,27(4):514-518.
Authors:YANG Sheng-tian  QIU Pei-liang
Affiliation:Department of Information Science and Electronic Engineering Zhejiang University Hangzhou 310027 China
Abstract:The upper and lower bounds of the average codeword length of Golomb codes for arbitrary probability distributions as well as an optimal rule for choosing parameters are given in terms of the mean of sources. Furthermore, a class of extended gamma codes which are the generalization of Elias gamma code is constructed based on Golomb codes. The performance bounds and an optimal rule for choosing parameters are also given. Extended gamma codes are universal and can achieve asymptotically optimal performance under some conditions. Finally, a low complexity universal data compression framework based on Golomb codes and extended gamma codes is presented, and a sample system is constructed to indicate the significance of the data compression framework in practice.
Keywords:Source coding  Integer coding  Golomb codes  Elias gamma code
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号