北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 1999, Vol. 22 ›› Issue (2): 89-91.

• 短文 • 上一篇    下一篇

采用Lynch-Davisson编码方法压缩多元信源序列

李祥明, 乐光新   

  1. 北京邮电大学电信工程学院, 北京 100876
  • 收稿日期:1998-08-31 出版日期:1999-03-10
  • 基金资助:
    国家教委高等学校博士学科点专项科研基金资助项目

Compression of Multiple Signals Source with Lynch-Davisson Code

Li Xiangming, Yue Guangxin   

  1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876
  • Received:1998-08-31 Online:1999-03-10

摘要: 为了利用Lynch-Davisson编码压缩多进制序列, 提出了一种推广方法, 该方法不再将信源序列划分成多个序列分别进行压缩, 而是采用一种统一的算法直接对信源进行压缩处理, 并证明了这种方法在渐进意义上可达到熵界.

关键词: 编码理论, 信源编码, 通用编码

Abstract: For compressing the multiple signal sources by Lynch-Davisson code, an extended method is presented.It is not necessary for the newmethod to split the original sources to two sequences any longer. It is showedthat as the sequence length N approaches infinity, the number of code bits per symbol approaches the entropy of the statistically independent symbol source.

Key words: coding theory, source coding, universal coding

中图分类号: