期刊文献+

卫星激光通信中一种基于矩阵扩展的RC-LDPC码构造方法 被引量:6

A Construction Method of RC-LDPC Codes Based on The Matrix Extension for Satellite Laser Communications
下载PDF
导出
摘要 为降低卫星激光通信系统中的硬件资源,结合斐波那契数列的性质,基于矩阵扩展的方法提出了一种码率兼容低密度奇偶校验(Rate-Compatible Low-Density Parity-Check,RCLDPC)码的构造方法。用该方法所构造的RC-LDPC码围长为6且具有准循环特性,所需存储元素少,降低了计算复杂度,利于硬件实现,更适合在卫星激光系统中传输。仿真结果表明:利用该方法构造的RC-LDPC码在较大码率范围内均具有良好的译码性能,且在相同条件下,当误码率(BER)为10-6时,所构造的RC-LDPC码与同码率、同码长的其他码型相比较,其净编码增益均有一定提高。 A novel construction method of rate-compatible low-density parity-check(RCLDPC)codes based on the matrix extension and combined with the properties of Fibonacci sequences is proposed in order to reduce the hardware resource in satellite laser communication systems.The RC-LDPC code with girth-6 and quasi-cyclic characteristics can be constructed by this construction method,which can save the storage elements and reduce the computational complexity.Its hardware implementation was more easily realized and the RC-LDPC code is more suitable for satellite laser communication systems.The simulation results show that the RCLDPC code constructed by this method can realize a better decoding performance in a wider coderate range.Under the same parameters,the net coding gain of the constructed RC-LDPC code is more than those of other codes with the same code-rate and code-length at the bit error rate(BER)of 10-6.
作者 袁建国 袁雅琴 刘议靖 YUAN Jianguo;YUAN Yaqin;LIU Yijing(Key Laboratory of Optical Communication and Networks,Chongqing University of Posts and Telecommunications,Chongqing 400065,CHN)
出处 《半导体光电》 CAS 北大核心 2020年第6期879-883,共5页 Semiconductor Optoelectronics
基金 国家自然科学基金项目(61971079,61671091)。
关键词 卫星激光通信 码率兼容低密度奇偶校验码 斐波那契数列 矩阵扩展 低复杂度 satellite laser communications RC-LDPC codes Fibonacci sequence matrix extension low complexity
  • 相关文献

参考文献2

二级参考文献18

  • 1GALLAGER R.Low-density parity-check codes[J].IRE Transactions on Information Theory,1962,8(1):21-28.
  • 2MACKAY D J C,NEAL R M.Near Shannon limit performance of low density parity check codes[J].Electronics letters,1996,32(18):1645.
  • 3MACKAY D J C.Good error-correcting codes based on very sparse matrices[J].IEEE Transactions on Information Theory,1999,45(2):399-431.
  • 4ASVADI R,BANIHASHEMI A H.A rate-compatible puncturing scheme for finite-length LDPC codes[J].IEEE Communications Letters,2013,17(1):147-150.
  • 5TANG H,XU J,LIN S,et al.Codes on finite geometries[J].IEEE Transactions on Information Theory,2005,51(2):572-596.
  • 6HAN G,GUAN Y,KONG L.Construction of irregular QC-LDPC codes via masking with ACE optimization[J].IEEE Communications Letters,2014,18(2):348-351.
  • 7ZHANG L,LIN S,ABDEL-GHAFFAR K,et al.Quasi-cyclic LDPC codes on cyclic subgroups of finite fields[J].IEEE Transactions on Communications,2011,59(9):2330-2336.
  • 8FOSSORIER M P C.Quasicyclic low-density parity-check codes from circulant permutation matrices[J].IEEE Transactions on Information Theory,2004,50(8):1788-1793.
  • 9ZHANG J,ZHANG G.Deterministic girth-eight QC-LDPC codes with large column weight[J].IEEE Communications Letters,2014,18(4):656-659.
  • 10HUANG J F,HUANG C M,YANG C C.Construction of one-coincidence sequence quasi-cyclic LDPC codes of large girth[J].IEEE Transactions on Information Theory,2012,58(3):1825-1836.

共引文献4

同被引文献68

引证文献6

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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