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

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY

Construction of Non-binary QC-LDPC Codes

Min Yang, Wenyan Zhang, Jie Zhong, Jie Wu

Published Feb 18, 2014• 1 citation
Publisher

Abstract

该文研究准循环多进制LDPC码的构造,给出多进制LDPC码的设计流程和构造方法。详细讨论了多进制LDPC码的性能影响因素,综合考虑了环长和环的连通性对性能的影响,研究了母矩阵扩展中偏移因子的选择以及GF(q)上非零元素替代。同时提出了次优解的搜索方法,以降低搜索复杂度。最后,将提出的方法用于不同阶数下LDPC码的构造。仿真结果表明,通过新方法构造得到的多进制LDPC码与二进制码相比,在BPSK调制方式下在误帧率10-4附近有0.2 dB的性能提升;在有限域阶数与调制阶数匹配的情况下,有更大的性能提升。与相近码长,相同码率的多进制循环码相比,该文构造得到的多进制LDPC码在误帧率10-4附近有0.25 dB的性能提升。

DOI
10.3724/sp.j.1146.2012.00403

Related papers

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

Construction of Quasi-Cyclic GF(q)-LDPC Codes Achieving the Upper Bound on the Minimum Hamming Distance

胡树楷, Yang Yang, 王新梅

为了构造在瀑布区和错误平层区都具有良好性能的多元低密度校验(LDPC)码,提出了一种提高多元准循环(QC)LDPC最小汉明距离的构造方法.针对列重为2的QC LDPC码,证明了其最小汉明距离的2个上界,并提出了一种支持线性复杂度并行编码的基矩阵设计,给出了构造原则.根据该原则构造出的QC LDPC码可达到其最小汉明距离上界,且具备并行线性编码的优点.仿真结果表明,该码在瀑布区域具有良好的性能,同时具有较好的错误平层特性.

Beijing Youdian Xueyuan xuebao•Jan 1, 2012•0 citations

Recursive construction of LDPC codes

刘斌彬, 白栋, 梅顺良

针对Tanner图中圈的增加会影响码的性能的问题,提出了一种递归构造低密度校验(LDPC)码的方法。该方法利用一个短的LDPC码的校验矩阵作为其母矩阵,在此基础上采用循环置换矩阵构造一个长的LDPC码。通过对循环转置矩阵的参数进行约束,可以保证所构造的长码的Tanner图中指定长度的圈的个数等于或者小于其短码,且可以构造规则或者非规则的LDPC码。.仿真结果表明,采用该方法构造的LDPC码具有较低的误码平台,其性能与好的随机LDPC码几乎相同。

Journal of Tsinghua University(Science and Technology)•Jan 1, 2007•0 citations

Non-Binary QC-LDPC Codes with Large Girth Devoid of Dominant Absorbing Sets

Suresh Kumar Venkataramanappa, Pavan Kumar, Deepak Mishra +1 more

Non-binary (NB) low-density parity-check (LDPC) codes offer superior error-correcting performance compared to binary LDPC codes, especially for short and medium lengths. Constructing such codes with large girth remains challenging due to various combinatorial constraints. We present a novel algebraic and graph-theoretic construction of non-binary quasi-cyclic (QC) LDPC codes with column weight two and girth 12, which is known to be largest achievable girth for array-based QC-LDPC codes. In constructing girth-12 (2, dc) NB-QC-LDPC codes, our method attains the minimum possible code length for dc < 10. Motivated by the fact that non-binary spatially coupled (SC) QC-LDPC codes achieve optimal performance at column weight three, we further construct NB-SC-QC-LDPC codes with girth ≥ 8 while effectively reducing the number of 8-cycles. Specifically, for (3, dc) codes, our design eliminates dominant absorbing sets such as the (3, 3) and (4, 2), eliminates the (5, 1) elementary absorbing sets (EAS), and eliminates almost all (6, 2) EAS, thereby directly enhancing the error-correction performance. The proposed NB-QC-LDPC codes achieve performance comparable to NB-LDPC codes used in the BeiDou satellite navigation system, while requiring a significantly smaller parity-check matrix storage footprint, for instance, around a 44× reduction in storage requirements with respect to BeiDou rate-1/2 (88, 44) code. Also, the proposed rate-1/2 code with length n = 684 provide a 0.4 dB gain over non-binary near-regular QC-LDPC code with same parameters proposed by Huang et al. [IEEE Trans. Commun.] while requiring a smaller parity-check matrix storage footprint. Furthermore, the proposed rate-1/2 NB-SC-QC-LDPC code having length n = 4608 achieve 0.1 dB coding gain compared to existing protograph constructions while requiring a significantly smaller parity-check matrix storage footprint, i.e., around a 192× reduction.

•Oct 15, 2025•0 citations

基于改进的整数量化 LDPC 码分层译码算法

Lingling Lao, 李立欣, 朱梦 +1 more

LDPC码分层译码算法在进行整数量化操作时,存储单元的限制会导致译码信息的溢出。本文系统分析了溢出错误的原因,并提出了两种改进的分层译码方案,错误部分消除方案( partially eliminating errors scheme,PEES)和不同比特量化方案(different bit quantization scheme,DBQS)。两种改进方案分别从消除部分错误和避免溢出错误的角度来改进译码性能,且硬件实现时只需增加一定数量的加法器和移位操作。通过对不同码长、不同量化比特的LDPC码进行仿真,结果表明,2种方案均有效地抑制了溢出错误,与基于全精度浮点数运算的修正算法相比,在误码率为1.0&#215;10-4时,分别仅有约1 dB和1.8 dB的性能损耗。

西北工业大学学报•Jan 1, 2014•0 citations

Performance comparison of non-binary RA and QC-LDPC codes

Wenli Ni, Jing He

Repeat Accumulate (RA) codes are subclass of low-density parity-check (LDPC) codes with fast encoder structures. QC-LDPC codes are also a class of LDPC codes and easy to be implemented. There were some paper had researched that non-binary LDPC codes have better performance cover binary ones. In this paper, It constructed non-binary RA codes with linear encoding method and non-binary QC-LDPC codes with algebraic constructions method. The BER performance of RA and QC-LDPC codes over GF(q) were compared by simulation over the Additive White Gaussian Noise (AWGN) channels. The simulation results concluded when code length and code rate are same, the BER performance of this two non-binary LDPC codes are very close, but they still have a little different point.

IEEE International Conference on Computer and Communications (ICCC)•Oct 1, 2016•1 citation
该文研究准循环多进制LDPC码的构造,给出多进制LDPC码的设计流程和构造方法。详细讨论了多进制LDPC码的性能影响因素,综合考虑了环长和环的连通性对性能的影响,研究了母矩阵扩展中偏移因子的选择以及GF(q)上非零元素替代。同时提出了次优解的搜索方法,以降低搜索复杂度。最后,将提出的方法用于不同阶数下LDPC码的构造。仿真结果表明,通过新方法构造得到的多进制LDPC码与二进制码相比,在BPSK调制方式下在误帧率10-4附近有0.2 dB的性能提升;在有限域阶数与调制阶数匹配的情况下,有更大的性能提升。与相近码长,相同码率的多进制循环码相比,该文构造得到的多进制LDPC码在误帧率10-4附近有0.25 dB的性能提升。
具有准循环结构的低密度奇偶校验码(QC-LDPC Codes)是目前被广泛采用的一类LDPC码。本文提出了一种结合PEG算法构造基于循环移位矩阵的QC-LDPC码的方法。该方法首先将QC-LDPC码传统的基于比特的二分图简化为基于Block的二分图,然后在该图中采用PEG算法遵循的环路最大原则确定每一个循环移位矩阵的位置,最后根据QC-LDPC码的环路特性为每一个循环移位矩阵挑选循环移位偏移量。利用该算法,本文构造了长度从1008bit到8064bit,码率从1/2到7/8各种参数的LDPC码。仿真结果表明,本文构造的LDPC码性能优于目前采用有限几何、两个信息符号的RS码、组合数学等常用的代数方法构造的QC-LDPC码。
为了构造在瀑布区和错误平层区都具有良好性能的多元低密度校验(LDPC)码,提出了一种提高多元准循环(QC)LDPC最小汉明距离的构造方法.针对列重为2的QC LDPC码,证明了其最小汉明距离的2个上界,并提出了一种支持线性复杂度并行编码的基矩阵设计,给出了构造原则.根据该原则构造出的QC LDPC码可达到其最小汉明距离上界,且具备并行线性编码的优点.仿真结果表明,该码在瀑布区域具有良好的性能,同时具有较好的错误平层特性.
针对Tanner图中圈的增加会影响码的性能的问题,提出了一种递归构造低密度校验(LDPC)码的方法。该方法利用一个短的LDPC码的校验矩阵作为其母矩阵,在此基础上采用循环置换矩阵构造一个长的LDPC码。通过对循环转置矩阵的参数进行约束,可以保证所构造的长码的Tanner图中指定长度的圈的个数等于或者小于其短码,且可以构造规则或者非规则的LDPC码。.仿真结果表明,采用该方法构造的LDPC码具有较低的误码平台,其性能与好的随机LDPC码几乎相同。
Non-binary (NB) low-density parity-check (LDPC) codes offer superior error-correcting performance compared to binary LDPC codes, especially for short and medium lengths. Constructing such codes with large girth remains challenging due to various combinatorial constraints. We present a novel algebraic and graph-theoretic construction of non-binary quasi-cyclic (QC) LDPC codes with column weight two and girth 12, which is known to be largest achievable girth for array-based QC-LDPC codes. In constructing girth-12 (2, dc) NB-QC-LDPC codes, our method attains the minimum possible code length for dc < 10. Motivated by the fact that non-binary spatially coupled (SC) QC-LDPC codes achieve optimal performance at column weight three, we further construct NB-SC-QC-LDPC codes with girth ≥ 8 while effectively reducing the number of 8-cycles. Specifically, for (3, dc) codes, our design eliminates dominant absorbing sets such as the (3, 3) and (4, 2), eliminates the (5, 1) elementary absorbing sets (EAS), and eliminates almost all (6, 2) EAS, thereby directly enhancing the error-correction performance. The proposed NB-QC-LDPC codes achieve performance comparable to NB-LDPC codes used in the BeiDou satellite navigation system, while requiring a significantly smaller parity-check matrix storage footprint, for instance, around a 44× reduction in storage requirements with respect to BeiDou rate-1/2 (88, 44) code. Also, the proposed rate-1/2 code with length n = 684 provide a 0.4 dB gain over non-binary near-regular QC-LDPC code with same parameters proposed by Huang et al. [IEEE Trans. Commun.] while requiring a smaller parity-check matrix storage footprint. Furthermore, the proposed rate-1/2 NB-SC-QC-LDPC code having length n = 4608 achieve 0.1 dB coding gain compared to existing protograph constructions while requiring a significantly smaller parity-check matrix storage footprint, i.e., around a 192× reduction.
LDPC码分层译码算法在进行整数量化操作时,存储单元的限制会导致译码信息的溢出。本文系统分析了溢出错误的原因,并提出了两种改进的分层译码方案,错误部分消除方案( partially eliminating errors scheme,PEES)和不同比特量化方案(different bit quantization scheme,DBQS)。两种改进方案分别从消除部分错误和避免溢出错误的角度来改进译码性能,且硬件实现时只需增加一定数量的加法器和移位操作。通过对不同码长、不同量化比特的LDPC码进行仿真,结果表明,2种方案均有效地抑制了溢出错误,与基于全精度浮点数运算的修正算法相比,在误码率为1.0&#215;10-4时,分别仅有约1 dB和1.8 dB的性能损耗。
Repeat Accumulate (RA) codes are subclass of low-density parity-check (LDPC) codes with fast encoder structures. QC-LDPC codes are also a class of LDPC codes and easy to be implemented. There were some paper had researched that non-binary LDPC codes have better performance cover binary ones. In this paper, It constructed non-binary RA codes with linear encoding method and non-binary QC-LDPC codes with algebraic constructions method. The BER performance of RA and QC-LDPC codes over GF(q) were compared by simulation over the Additive White Gaussian Noise (AWGN) channels. The simulation results concluded when code length and code rate are same, the BER performance of this two non-binary LDPC codes are very close, but they still have a little different point.