期刊文献+

一种用于星地高速通信的Raptor码设计

Design of Raptor Code for Space-to-Ground High Speed Communication
下载PDF
导出
摘要 利用空间网络进行中继通信是未来星地通信的主要方式,而空间网络环境存在链路不稳定、传输距离大等缺陷,这些缺陷使得星地通信效率较低,且通信质量不理想。为了解决上述问题,提出一种适合空间网络中继通信的R印tor码作为前向纠删码。首先,以简化的LDGM码为外码、以弱化的LT码为内码得出Raptor码的编码结构,其次,为了适应中继星受限的星上存储与处理能力,对Shokrollahi提出的截短度分布函数进行改进,得出一个适合小文件传输的截短度分布函数作为内码的度分布函数。仿真结果表明,Raptor码能有效提高传输效率,编译码复杂度低,且译码开销较小。在星地中继通信时,Raptor码能满足高速通信的要求。 Relay communication by space network is the main method of future space - to - ground communication, however, space network has low stability and huge transmission distance, which results in low efficiency and poor quality of space - to - ground communication. A kind of Raptor code was designed as forward erasure code for space network to solve these problems. Firstly, using simplified LDGM as outer code and truncated LT as inner code, the coding structure of Raptor code was obtained. Secondly,in order to adapt to limited on - board storage and processing capability of relay satellites, a degree distribution function for small file was obtained by improving the truncated distribution function raised by Shokrollahi. Simulation results show that the Raptor code can effectively improve transmission effficiency,and has low complexity, besides, its decoding overhead is less than 15%. This Raptor code can meet the requirements of high - speed communication in space - to - ground relay communication.
出处 《计算机仿真》 北大核心 2017年第2期225-229,325,共6页 Computer Simulation
基金 载人航天领域预先研究项目(050102)
关键词 中继通信 数字喷泉码 分布函数 Relay communication Digital fountain code Distribution function
  • 相关文献

参考文献4

二级参考文献28

  • 1F H P Fitzek, M D Katz. Cooperation in Wireless Networks: Principles and Applications [M]. Dordrecht, Netherland: Springer, 2006.
  • 2A Scaglione, D L Goeckel, J N Laneman. Cooperative communications in mobile ad hoc networks[J]. IEEE Signal Processing Magazine, 2006,23 (5) : 18 - 29.
  • 3J Byers, M Luby, M Mitzenmacher. A digital fountain approach to asynchronous reliable multicast[J]. IEEE Journal on Selected Areas in Communications,2(D2,20(8):1528- 1540.
  • 4M Mitzenmacher. Digital fountains: a survey and look forward [ A ]. Proceedings of IEEE Information Theory Workshop (ITW)[C]. IEEE Press,2004.271- 276.
  • 5D J C Mackay. Fountain codes[J]. IEE Communications Proceedings,2005,152(6) : 1062 - 1068.
  • 6M Luby. LT codes[ A ]. Proceedings of IEEE Foundations of Computer Science (POCS) [C]. IEEE Press, 2002.271 - 282.
  • 7A Shokrollahi. Raptor codes[J]. IEEE Transactions on Information Theory,2006,52(6) :2551 - 2567.
  • 8R Palanki,J S Yedidia. Rateless codes on noisy channels[A].Proceedings of IEEE International Symposium on Information Theory (ISIT)[C] .IEEE Press,2004.37.
  • 9J Castura, Y Mao. Rateless coding over fading channels [J]. IEEE Communications Letters, 2006,10(1) :46 -48.
  • 10A F Molisch,N B Mehta,J S Yedidia, et al. Cooperative relay networks using fountain codes [A]. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM)[C]. IEEE Press, 2006.1 - 6.

共引文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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