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 Quasi-Cyclic LDPC Codes From Prime Fields

Guo-qing Lin, Ru-wei Chen, Xinmei Wang, Xiao Guo-zhen

Published Apr 19, 2010• 0 citations
Publisher

Abstract

摘要: 该文提出一种基于素域构造准循环低密度校验码的方法。该方法是Lan等所提出基于有限域构造准循环低密度校验码的方法在素域上的推广，给出了一类更广泛的基于素域构造的准循环低密度校验码。通过仿真结果证实：所构造的这一类准循环低密度校验码在高斯白噪声信道上采用迭代译码时具有优良的纠错性能。 关键词: 低密度校验码; 准循环码; 素域; 本原元

DOI
10.3724/sp.j.1146.2009.00208

Related papers

A Synchro Partially Parallel Architecture for Quasi-Cyclic LDPC Codes

Enyang Xu, Ming Jiang, Chunming Zhao

摘要: 该文根据准循环LDPC码的结构特点,提出了一种同步部分并行结构的译码器。在译码器中,校验节点处理单元和变量节点处理单元同时并行工作,使得迭代过程中新产生的软信息能够被提前使用,加快迭代的收敛速度。同时,采用差分演化的方法对各节点处理单元的起始位置进行优化,进一步提高了译码器的性能。仿真结果表明,该方案在译码性能和复杂度上都要优于现有其他方案,适合高速译码器的实现。 关键词: 低密度奇偶校验（LDPC）码; 译码器; 同步部分并行结构

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Mar 22, 2011•1 citation

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 Decoding Algorithm Based on Layered Decoding and Min-max for Nonbinary LDPC Codes

Wei Ling Yang, Wei Zhang

摘要: 该文在现有译码算法的基础上提出一种高效的非二进制低密度奇偶校验码(NB-LDPC)译码方法，充分利用了分层译码算法与Min-max算法的优点，不但译码复杂度低、需要的存储空间小，而且可将译码速度提高一倍。应用该算法，对一种定义在GF(25)上的(620,509)码进行了仿真。该码的仿真结果表明：在相同误码率下，该文译码算法所需最大迭代次数仅为Zhang的算法(2011)的45%。 关键词: 非二进制低密度奇偶校验码(NB-LDPC) / 分层译码 / Min-max / 准循环码

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Feb 24, 2014•2 citations

Construction of good quasi-cyclic LDPC codes

Xiao Xiao, Lee

•Jan 1, 2006•16 citations

Quasi-Cyclic LDPC Code Design for Practical Applications

Behzad Momahed Heravi, Sharadha Kariyawasam, Nishit Pandya +1 more

•Nov 1, 2008•0 citations

Generalised array low‐density parity‐check codes

R. Sobhani

In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of prime order to those of prime power order. In fact, they consider the additive group of the finite field GF( q ), q a prime power, as the underlying group for the GP‐LDPC code construction and since when q is a prime, the author's code construction method coincides with that of quasi‐cyclic array LDPC codes, they call their codes, generalised array LDPC (GA‐LDPC) codes. First, they prove that, like array LDPC codes, GA‐LDPC codes are quasi‐cyclic codes. Then, they analyse the girth of GA‐LDPC codes in a way similar to that for array LDPC codes and introduce some shortened GA‐LDPC codes with girths 8, 10 and 12. For many values of g , J and L , the lengths of ( J , L )‐regular shortened GA‐LDPC codes of girth g and rate at least 1 − J / L , constructed in this study, are smaller than the lengths of ( J , L )‐regular LDPC codes of girth g and rate at least 1 − J / L , constructed in the literature. Also, simulation results show that GA‐LDPC codes perform well with the iterative message‐passing decoding.

IET Communications•Jun 26, 2014•2 citations
摘要: 该文提出一种基于素域构造准循环低密度校验码的方法。该方法是Lan等所提出基于有限域构造准循环低密度校验码的方法在素域上的推广，给出了一类更广泛的基于素域构造的准循环低密度校验码。通过仿真结果证实：所构造的这一类准循环低密度校验码在高斯白噪声信道上采用迭代译码时具有优良的纠错性能。 关键词: 低密度校验码; 准循环码; 素域; 本原元
摘要: 该文根据准循环LDPC码的结构特点,提出了一种同步部分并行结构的译码器。在译码器中,校验节点处理单元和变量节点处理单元同时并行工作,使得迭代过程中新产生的软信息能够被提前使用,加快迭代的收敛速度。同时,采用差分演化的方法对各节点处理单元的起始位置进行优化,进一步提高了译码器的性能。仿真结果表明,该方案在译码性能和复杂度上都要优于现有其他方案,适合高速译码器的实现。 关键词: 低密度奇偶校验（LDPC）码; 译码器; 同步部分并行结构
摘要: 该文在现有译码算法的基础上提出一种高效的非二进制低密度奇偶校验码(NB-LDPC)译码方法，充分利用了分层译码算法与Min-max算法的优点，不但译码复杂度低、需要的存储空间小，而且可将译码速度提高一倍。应用该算法，对一种定义在GF(25)上的(620,509)码进行了仿真。该码的仿真结果表明：在相同误码率下，该文译码算法所需最大迭代次数仅为Zhang的算法(2011)的45%。 关键词: 非二进制低密度奇偶校验码(NB-LDPC) / 分层译码 / Min-max / 准循环码
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of prime order to those of prime power order. In fact, they consider the additive group of the finite field GF( q ), q a prime power, as the underlying group for the GP‐LDPC code construction and since when q is a prime, the author's code construction method coincides with that of quasi‐cyclic array LDPC codes, they call their codes, generalised array LDPC (GA‐LDPC) codes. First, they prove that, like array LDPC codes, GA‐LDPC codes are quasi‐cyclic codes. Then, they analyse the girth of GA‐LDPC codes in a way similar to that for array LDPC codes and introduce some shortened GA‐LDPC codes with girths 8, 10 and 12. For many values of g , J and L , the lengths of ( J , L )‐regular shortened GA‐LDPC codes of girth g and rate at least 1 − J / L , constructed in this study, are smaller than the lengths of ( J , L )‐regular LDPC codes of girth g and rate at least 1 − J / L , constructed in the literature. Also, simulation results show that GA‐LDPC codes perform well with the iterative message‐passing decoding.