期刊文献+

级联编码在地空数据链信道编码中的应用研究 被引量:1

Channel Coding of Data Link Based on Concatenated Coding
下载PDF
导出
摘要 为了克服传统信道编码方式的缺点,提高地空数据链信道传输的可靠性和传输效率,同时降低信道编码的复杂度,采用了级联编码的方法,将重复累加码与喷泉码进行级联后,应用到地空通信数据链信道编码当中。首先阐述了重复累加码、喷泉码的基本原理和编解码方法,重点介绍了两种码的级联方法,并通过实验进行了论证和比较,实验证明,通过级联方式编码后,数据链信道的误帧率明显降低,通信效果得到明显改善。研究结果表明,级联编码方法不仅能充分发挥喷泉码的特点,而且无线数据传输的可靠性得到明显改善。 In order to overcome the traditional shortcomings of the channel coding and improve the transmission reliability and efficiency of ground-air data link channel while reducing the complexity of channel coding,the method of concatenate encoding was applied in the ground-air data link channel coding.First,the basic principles and methods of encoding and decoding for the repeat accumulate codes and fountain codes were described.Then,the concatenating methods for two kinds of code were introduced,which were demonstrated by experiments.The experiments showed that,through the concatenated encoding,the frame error rate of data link channel was reduced significantly,and the communication effect was improved greatly.The result of study shows that the concatenate encoding method can not only give full play to the characteristics of fountain codes,but also improve the reliability of wireless data transmission significantly.
出处 《电光与控制》 北大核心 2012年第11期84-88,共5页 Electronics Optics & Control
关键词 地空通信 数据链 信道编码 喷泉码 重复累加码 级联 ground-air communication data link channel encoding fountain code repeat accumulate code concatenation
  • 相关文献

参考文献10

二级参考文献42

  • 1朱爱军,郎宏山,武震东.RS编码与卷积编码级连在遥感卫星数据传输中的应用[J].遥感信息,2007,29(1):47-52. 被引量:6
  • 2Gallager R G. Low density parity check codes [J]. IRE Transactions on Information Theory, 1962, 8(1): 21-28.
  • 3Davey M and MacKay D J C. Low density parity check codes over GF(q) [J]. IEEE Communications Letters, 1998, 2(6): 165-167.
  • 4Marinoni A and Savazzi P. Non-binary LDPC codes with good performance on channels affected by bursty noise, www.gt ti.it/GTTI08/files/SessioneScientifica/marinoni.pdf, 2008.
  • 5Song H and Cruz J R. Reduced-complexity decoding of q-ary LDPC codes for magnetic recording [J]. IEEE Transactions on Magnetics, 2003, 39(2): 1081-1087.
  • 6Richardson T J and Urbanke R L. The capacity of low-density parity-check codes under message-passing decoding [J]. IEEE Transactions on Information Theory, 2001, 47(2): 599-618.
  • 7Declercq D and Fossorier M. Decoding algorithms for nonbinary LDPC codes over GF(q)[J]. IEEE Transactions on Communications, 2007, 55(4): 633-643.
  • 8Savin V and Minatec C L. Min-Max decoding for nonbinary LDPC codes[C]. ISIT 2008, Toronto, Canada, 2008: 960-964.
  • 9Hu X Y, Eleftheriou E, and Arnold D M. Regular and irregular progressive edge-growth tanner graphs [J]. IEEE Transactions on Information Theory, 2005, 51(1): 386-398.
  • 10Lin Shu, Song Shu-mei, and Lan Lan, et al.. Constructions of nonbinary quasi-cyclic LDPC codes: A finite field approach [J]. IEEE Transactions on Communications, 2008, 56(4): 545-554.

共引文献8

同被引文献14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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