...
首页> 外文期刊>Wireless communications & mobile computing >Construction of Quasi-Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic
【24h】

Construction of Quasi-Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic

机译:基于算术基础定理的准循环LDPC代码构建

获取原文
获取原文并翻译 | 示例
           

摘要

Quasi-cyclic (QC) LDPC codes play an important role in 5G communications and have been chosen as the standard codes for 5G enhanced mobile broadband (eMBB) data channel. In this paper, we study the construction of QC LDPC codes based on an arbitrary given expansion factor (or lifting degree). First, we analyze the cycle structure of QC LDPC codes and give the necessary and sufficient condition for the existence of short cycles. Based on the fundamental theorem of arithmetic in number theory, we divide the integer factorization into three cases and present three classes of QC LDPC codes accordingly. Furthermore, a general construction method of QC LDPC codes with girth of at least 6 is proposed. Numerical results show that the constructed QC LDPC codes perform well over the AWGN channel when decoded with the iterative algorithms.
机译:准循环(QC)LDPC码在5G通信中发挥着重要作用,已被选为5G增强移动宽带(eMBB)数据信道的标准码。本文研究了基于任意给定扩展因子(或提升度)的QC-LDPC码的构造。首先,我们分析了QC-LDPC码的循环结构,给出了短循环存在的充要条件。基于数论中的算术基本定理,我们将整数分解分为三种情况,并相应地给出了三类QC-LDPC码。此外,还提出了一种周长至少为6的QC-LDPC码的一般构造方法。数值结果表明,当使用迭代算法解码时,所构造的QC-LDPC码在AWGN信道上表现良好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号