期刊文献+

基于滑窗置信传播算法的联合信源信道编码 被引量:1

Joint Source-channel Coding Based on Sliding-window Belief Propagation
下载PDF
导出
摘要 针对联合信源信道编码中信源统计特性和信道噪声参数未知情况下,解码算法性能急剧下降的问题,提出一种基于滑窗置信传播算法(SWBP)的联合信源信道编码,简称滑窗算法。研究采用不规则重复累积(IRA)码来实现基于滑窗置信传播算法的联合信源信道编码,IRA码可以取得与低密度奇偶校验(LDPC)码同样优越的性能,但编码复杂度远远低于LDPC码。在解码端引入滑动窗口,通过实时地估计不断变化的信源统计特性和信道噪声参数,从而提高解码速率。实验结果表明该算法具有接近相关参数已知情况下的理想性能、不依赖于初始参数、复杂度低且易于实现等优点。 To solve the problem of unknown source statistical properties and channel noise parameters and that of the decoding performance degradation,a new joint source-channel coding scheme based on the Sliding-Window Belief Propagation (SWBP) algorithm is proposed.In this paper,irregular repeat accumulate (IRA) is adopted to achieve the SWBP algorithm in joint sourcechannel coding.IRA coding can obtain the same superior performance with low density parity check (LDPC) coding,but less than complexity.A sliding-window is introduced in the decoder,and the decoding rate is improved by estimating the changing source statistical properties and channel noise parameters real-timely.The experiment results show that the performance of the proposed algorithm is close to the ideal curve when correlation parameters have been given.While the algorithm shows other advantages,including the robustness to initial parameters,the low linear time complexity,and easy to implement.
出处 《电视技术》 北大核心 2015年第11期99-103,共5页 Video Engineering
基金 国家自然科学基金项目(61271280) 中央高校基本科研业务项目(QN2013086)
关键词 联合信源信道编码 不规则重复累积码 置信传播 相关参数估计 低密度奇偶校验码 joint source-channel coding irregular repeat accumulate coding belief propagation correlation estimation low density parity check coding
  • 相关文献

参考文献15

二级参考文献81

共引文献5

同被引文献12

  • 1彭立,朱光喜,吴晓晓.基于等差数列的LDPC码编码器设计[J].电子学报,2007,35(5):950-954. 被引量:5
  • 2GALLAGER R. Low-density parity-check codes[ J]. IRE transactions on information theory, 1962,8 ( 1 ) : 21 -28.
  • 3FOSSORIER M P C, M1HALJEVIC M, INAI H. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation[ J]. IEEE transactions on communications, 1999,47 ( 5 ) : 673 -680.
  • 4CHUANG S Y, FORNEY Jr G D, RICHARDSON T J,et al. On the design of low-density parity-check codes within 0. 0045 dB of the Shannon limit [ J ]. IEEE communications letters, 2001,5 ( 2 ) : 58-60.
  • 5JIN H. Analysis and design of turbo-like codes[ D]. Cali- fornia : California Institute of Technology,2001.
  • 6YANG M, RYAN W E, LI Y. Design of efficiently encod- able moderate-length high-rate irregular LDPC codes[ J]. IEEE transactions on communications, 2004,52 ( 3 ) : 564- 571.
  • 7CHEN P J,ZHU L X, HU Q, et al. PEG algorithm based in- terleavers design for systematic IRA codes[ C]//Proc. 8th International Symposium on Antennas, Propagation and EM Theory ( ISAPE). Kunming : IEEE,2008 : 1458-1461.
  • 8HU X Y, ELEFTHEIOU E, ARNOLD D M. Progressive edge-growth Tanner graphs[ C]//Proc. 2001 Global Tele- communications Conference ( GLOBECOM'01 ). San An- tonio: IEEE, 2001 : 995 - 1001.
  • 9TIAN T, JONES C R,VILLASENOR J D, et al. Selective a- voidance of cycles in irregular LDPC code construction[ J]. IEEE transactions on communications, 2004,52 ( 8 ) : 1242- 1247.
  • 10JIANG X Q,XIA X G, LEE M. Efficient progressive edge- growth algorithm based on chinese remainder theorem [ J ]. IEEE transactions on communications, 2014,62 ( 2 ) : 442- 451.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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