期刊文献+

2元信源算术编码的研究

Study of Arithmetic Coding for Binary Sources
在线阅读 下载PDF
导出
摘要 算术码的核心是基于仙农提出的累积概率的思想.迄今为止,各文献对于累积概率的描述均是相对于独立信源的.本文给出了2元相关信源的累积概率定义,从而系统地论证了该类信源的算术码编译码原理.此外,本文对 R-L2元算术码中的进位传播问题、k(s)选取问题,以及编效率进行了定性的分析,为该码的实用奠定了基础. Arithmetic coding is based on the concept of cumulative Probability proposed by Shannon.The discussion of cumulative probability on most published papers were limited to the condition of independent sources.In this paper,an explicit definition of cumulative probability is given for binary correlated sources,and the principle of arithmetic coding for such sources is verified.Besides,the remaining problems in R-L binary arithmetic coding,such as propagation of carry,selection of k(s)and analysis of coding efficiency,are discussed,and the results lay a foundation for practical use of the coding schemes.
作者 王继东
出处 《北京邮电学院学报》 CSCD 1989年第4期7-13,共7页
关键词 2元信源 编码 算术码 arithmetic codes cumulative probability binary source
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部