Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

电视技术

Performance Study on QC-LDPC Code Based on PC-PEG Algorithm Construction

杨张, 袁梅冷, 雷海军

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

针对PEG(Progressive EdgeGrowth)算法构造的LDPC码在保证局部围长最大时仍有较多数目的小环,提出利用PC(Polynomial of Cycle)标记将PEG算法进行改进为PC-PEG算法,并应用于准循环码(QC-LDPC)中。该方法在满足局部围长尽可能大的前提下,减少了小环数目,提高了译码性能。引入QC-LDPC码的特性,其中校验矩阵是一种分块的循环移位码,该特定结构在工程上可以实现部分并行译码,节省存储空间。实验结果表明,该方法与PEG算法相比具有较少的小环数目,而准循环结构的特点在保证译码性能相当的前提下实现了工程上的部分并行译码。

Related papers

The Construction of Quasi-cyclic LDPC Codes and its Simulation Performance

Jingdong Zhong, Liang Zhao

论文研究了准循环LDPC码的构造方法,并对其译码性能进行了仿真.结果表明,准循环LDPC码在中短码时具有很强的纠错能力,性能接近目前与其长度相仿的最好的LDPC码,且编译码简单,易于实现,因而具有广阔的应用前景.

Computer Engineering and Applications Journal•Jan 1, 2006•3 citations

A modified PEG algorithm for construction of LDPC codes with Polynomial of Cycle

Lei Xiong, Dongping Yao, Yimeng Wu

Progressive Edge-Growth (PEG) algorithm is a novel approach for construction of low-density parity-check (LDPC) codes with large girth. However, PEG algorithm ignores the effect of the number of shortest cycles. In this paper, we propose a modified PEG algorithm with Polynomial of Cycle, which achieves not only large girth, but also minimizes the number of shortest cycles significantly. Simulation results show that our proposed algorithm can improves the performance of LDPC codes.

IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications•Oct 1, 2009•3 citations

Construction of LDPC Codes Based on Circulant Permutation Matrices

Hua Qiao, Guan Wu, Mingke Dong +1 more

具有准循环结构的低密度奇偶校验码(QC-LDPC Codes)是目前被广泛采用的一类LDPC码。本文提出了一种结合PEG算法构造基于循环移位矩阵的QC-LDPC码的方法。该方法首先将QC-LDPC码传统的基于比特的二分图简化为基于Block的二分图,然后在该图中采用PEG算法遵循的环路最大原则确定每一个循环移位矩阵的位置,最后根据QC-LDPC码的环路特性为每一个循环移位矩阵挑选循环移位偏移量。利用该算法,本文构造了长度从1008bit到8064bit,码率从1/2到7/8各种参数的LDPC码。仿真结果表明,本文构造的LDPC码性能优于目前采用有限几何、两个信息符号的RS码、组合数学等常用的代数方法构造的QC-LDPC码。

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Apr 12, 2011•4 citations

An improved algorithm for constructing QC-LDPC codes based on the PEG algorithm

Zhiyong Fan, Weibo Zhang, Xingcheng Liu +1 more

The Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach in designing Low-density parity-check (LDPC) codes. However, the Tanner graph constructed with the PEG algorithm is non-structured, which leads to random distributions of the positions of 1's in the corresponding parity-check matrix. In this paper, an improved algorithm based on the PEG algorithm for constructing quasi-cyclic (QC) LDPC codes is proposed. The proposed algorithm can eliminate short cycles efficiently and gain low error-floors. What is more important, the proposed QC-LDPC codes construction method is hardware-friendly because of its quasi-cyclic structure. Our simulation results demonstrate that the codes constructed with the proposed algorithm has better performance than the PEG algorithm over the additive white Gaussian noise (AWGN) channel and Rayleigh flat fading channel.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2009•5 citations

QC-LDPC Code Construction by Proto-Matrix Extension Based on Depth Tree

蔡佳育

The error-correcting code (ECC) is one of the channel coding technique widely used in many applications. Low density parity check (LDPC) codes have a remarkable performance Among the error-correcting codes, and have drawn significant attention for their error-correcting capability using the message-passing decoding algorithm. The PEG algorithm is a good sub-optimal method to construct the Tanner graph for a LDPC code. By progressively establishing edges between the furthest nodes, the PEG algorithm is able to build a Tanner graph while maximizing length of the cycle caused in the edge adding progress. In this thesis, we introduces a greedy algorithm for quasi-cyclic (QC) LDPC code construction, which works in the same manner as the PEG algorithm. QC-LDPC codes are a subclass of LDPC codes which gains benefits on encoding/decodng complexity reduction from their circular shifting structures. In the proposed algorithm, a QC-LDPC code is built by extending a small size matrix to the target size with large cycles. Our algorithm focuses on cycle length stretching during the matrix extension. The matrix extension is implemented by fitting proper circulant matrix while eliminating short cycles. We present a new kind of depth tree for circulant search in matrix extension procedure. Our algorithm brings out the QC-LDPC code with reconfigurable code parameter settings and has good performance close to PEG LDPC codes. Furthermore, the use of matrix extension reduces the computation scale, and provides a efficient and easy-to-implement method to construct a QC-LDPC code.

•Jan 1, 2014•0 citations

A Class of High-Rate Low-Complexity QC-LDPC Codes

Long-jiang Jing, Jing-li Lin, Zhu Wei-le

该文设计了一种特殊的高码率准循环低密度校验(QC-LDPC)码,其校验矩阵以单位矩阵的循环移位阵为基本单元,与随机构造的LDPC码相比可节省大量存储单元。利用该码校验矩阵的近似下三角特性,一种高效的递推编码方法被提出,它使得该码编码复杂度与码长成线性关系。另外,该文提出一种分析QC-LDPC码二分图中短长度环分布情况的方法,并且给出了相应的不含长为4环QC-LDPC码的构造方法。计算机仿真结果表明,新码不但编码简单,而且具有高纠错能力、低误码平层。

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Mar 17, 2011•0 citations
针对PEG(Progressive EdgeGrowth)算法构造的LDPC码在保证局部围长最大时仍有较多数目的小环,提出利用PC(Polynomial of Cycle)标记将PEG算法进行改进为PC-PEG算法,并应用于准循环码(QC-LDPC)中。该方法在满足局部围长尽可能大的前提下,减少了小环数目,提高了译码性能。引入QC-LDPC码的特性,其中校验矩阵是一种分块的循环移位码,该特定结构在工程上可以实现部分并行译码,节省存储空间。实验结果表明,该方法与PEG算法相比具有较少的小环数目,而准循环结构的特点在保证译码性能相当的前提下实现了工程上的部分并行译码。
具有准循环结构的低密度奇偶校验码(QC-LDPC Codes)是目前被广泛采用的一类LDPC码。本文提出了一种结合PEG算法构造基于循环移位矩阵的QC-LDPC码的方法。该方法首先将QC-LDPC码传统的基于比特的二分图简化为基于Block的二分图,然后在该图中采用PEG算法遵循的环路最大原则确定每一个循环移位矩阵的位置,最后根据QC-LDPC码的环路特性为每一个循环移位矩阵挑选循环移位偏移量。利用该算法,本文构造了长度从1008bit到8064bit,码率从1/2到7/8各种参数的LDPC码。仿真结果表明,本文构造的LDPC码性能优于目前采用有限几何、两个信息符号的RS码、组合数学等常用的代数方法构造的QC-LDPC码。
The Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach in designing Low-density parity-check (LDPC) codes. However, the Tanner graph constructed with the PEG algorithm is non-structured, which leads to random distributions of the positions of 1's in the corresponding parity-check matrix. In this paper, an improved algorithm based on the PEG algorithm for constructing quasi-cyclic (QC) LDPC codes is proposed. The proposed algorithm can eliminate short cycles efficiently and gain low error-floors. What is more important, the proposed QC-LDPC codes construction method is hardware-friendly because of its quasi-cyclic structure. Our simulation results demonstrate that the codes constructed with the proposed algorithm has better performance than the PEG algorithm over the additive white Gaussian noise (AWGN) channel and Rayleigh flat fading channel.
The error-correcting code (ECC) is one of the channel coding technique widely used in many applications. Low density parity check (LDPC) codes have a remarkable performance Among the error-correcting codes, and have drawn significant attention for their error-correcting capability using the message-passing decoding algorithm. The PEG algorithm is a good sub-optimal method to construct the Tanner graph for a LDPC code. By progressively establishing edges between the furthest nodes, the PEG algorithm is able to build a Tanner graph while maximizing length of the cycle caused in the edge adding progress. In this thesis, we introduces a greedy algorithm for quasi-cyclic (QC) LDPC code construction, which works in the same manner as the PEG algorithm. QC-LDPC codes are a subclass of LDPC codes which gains benefits on encoding/decodng complexity reduction from their circular shifting structures. In the proposed algorithm, a QC-LDPC code is built by extending a small size matrix to the target size with large cycles. Our algorithm focuses on cycle length stretching during the matrix extension. The matrix extension is implemented by fitting proper circulant matrix while eliminating short cycles. We present a new kind of depth tree for circulant search in matrix extension procedure. Our algorithm brings out the QC-LDPC code with reconfigurable code parameter settings and has good performance close to PEG LDPC codes. Furthermore, the use of matrix extension reduces the computation scale, and provides a efficient and easy-to-implement method to construct a QC-LDPC code.
该文设计了一种特殊的高码率准循环低密度校验(QC-LDPC)码,其校验矩阵以单位矩阵的循环移位阵为基本单元,与随机构造的LDPC码相比可节省大量存储单元。利用该码校验矩阵的近似下三角特性,一种高效的递推编码方法被提出,它使得该码编码复杂度与码长成线性关系。另外,该文提出一种分析QC-LDPC码二分图中短长度环分布情况的方法,并且给出了相应的不含长为4环QC-LDPC码的构造方法。计算机仿真结果表明,新码不但编码简单,而且具有高纠错能力、低误码平层。