首页> 外文会议>IEEE Information Theory Workshop >Explicit constructions for type-1 QC-LDPC codes with girth at least ten
【24h】

Explicit constructions for type-1 QC-LDPC codes with girth at least ten

机译:围长至少为10的Type-1 QC-LDPC码的显式构造

获取原文

摘要

From Sidon sequence over Z, two classes of type-1 (J = 3;L) QC-LDPC codes are explicitly proposed with block length LP and with girth at least ten. For the first method, any Sidon sequence over Z (P odd) with cardinality no smaller than L (L odd) corresponds to a class of type-1 (3, L) QC-LDPC codes with girth at least ten. For the second one, any Sidon sequence over Z (P prime) with cardinality no smaller than L (L arbitrary) corresponds to a class of type-1 (3, L) QC-LDPC codes with girth at least ten. Compared with the method from 3-D lattices, which can also generate type-1 QC-LDPC codes with girth at least ten, the main advantage of the new methods is that the construction process is much simpler, and L is not necessarily a prime integer. Simulation results show that the new type-1 QC-LDPC codes outperform the girth-8 QC-LDPC codes constructed by Sidon sequence or the earliest sequence, and perform almost as well as Bocharova's shortest girth-12 QC-LDPC codes.
机译:根据Z上的Sidon序列,明确提出了两类1型(J = 3; L)QC-LDPC码,其块长为LP,周长至少为10。对于第一种方法,基数不小于L(L奇数)的Z(P奇数)上的任何Sidon序列都对应一类周长至少为10的类型1(3,L)的QC-LDPC码。对于第二个,基数不小于L(L任意)的Z(P素数)上的任何Sidon序列都对应于一类Q(周长至少为10)的QC-LDPC码。与使用3-D晶格的方法相比,该方法还可以生成周长至少为10的Type-1 QC-LDPC码,新方法的主要优点是构造过程更简单,并且L不一定是素数整数。仿真结果表明,新的1型QC-LDPC码优于由Sidon序列或最早的序列构成的8级QC-LDPC码,其性能几乎与Bocharova最短的12级QC-LDPC码一样好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号