.png){kind=icon}
返回
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2688701.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code. The girth of the QC protograph LDPC code is determined by the girth of the base graph and the permutation shifts. In this paper, we first derive a lower bound on the lifting degree to achieve a large girth lifted graph. Then, motivated by the cycle searching and girth maximizing features of the progressive edge-growth (PEG) algorithm, we introduce the permutation shifts determining (PSD) PEG algorithm, which can construct large girth base graph and determine the optimal permutation shifts, simultaneously. It is shown that the computational complexity of PSD-PEG algorithm is much lower than that of the PEG algorithm and the PEG-QC algorithm for the same codeword length. Furthermore, we show that the PSD-PEG algorithm can also be used to construct nonbinary QC protograph LDPC codes without low weight codes. Simulation results show that the binary and nonbinary QC protograph LDPC codes constructed by the PSD-PEG algorithm have good bit error rate performance and frame error rate performance over the additive white Gaussian noise channel.
Keyword:
Progressive edge-growth (PEG) algorithm
QC protograph LDPC code
permutation shifts
girth
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Recursive Design of High Girth (2,k) LDPC Codes from (k,k) LDPC Codes从 (k，k) LDPC码递归设计高围 (2，k) LDPC码
PREAI
分享收藏Why Baltic Shield zircons yield late Paleozoic, lower-intercept ages on U-Pb concordia.png)
Geology
GeologyIF0
PREAI
分享收藏Binuclear copper complexes of ligands providing three donors to each metal ion配体的双核铜配合物为每个金属离子提供三个供体
PREAI
分享收藏
查看更多内容