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

A Decoding Algorithm Based on Layered Decoding and Min-max for Nonbinary LDPC Codes

Wei Ling Yang, Wei Zhang

Published Feb 24, 2014• 2 citations
Publisher

Abstract

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

DOI
10.3724/sp.j.1146.2012.01634

Related papers

Weighted Symbol-flipping Decoding for Nonbinary LDPC Codes Based on a New Stopping Criterion

Bing Liu, Wei Tao, Gaoqi Dou +1 more

摘要: 为了降低多进制低密度奇偶校验(Low-Density Parity-Check,LDPC)码译码算法的复杂度,该文提出了基于新停止准则的符号翻转译码算法。该算法根据翻转函数和接收比特可靠性度量来确定对应的翻转符号,通过分析不满足校验方程个数的变化趋势来提前终止迭代。仿真结果表明,新算法在保持原有符号翻转译码算法误码性能不变的情况下,极大地减少了译码迭代次数,取得了译码性能和复杂度的折衷。 关键词: 多进制低密度奇偶校验码 / 符号翻转译码 / 停止准则 / 环路检测 / 有限域

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

Efficient Partial-Parallel Decoder Architecture for Quasi-Cyclic Nonbinary LDPC Codes

Xinmiao Zhang, Fang Cai

Nonbinary low-density parity-check (NB-LDPC) codes constructed over GF(q) (q >; 2) can achieve higher coding gain than binary LDPC codes when the code length is moderate. A complete partial-parallel decoder architecture based on the Min-max algorithm is proposed for quasi-cyclic NB-LDPC codes in this paper. A novel scheme and corresponding architecture are developed to implement the elementary step of the check node processing. In our design, layered decoding is applied and only nm5) has also been synthesized on a Xilinx Virtex-2 Pro FPGA device. It can achieve a throughput of 9.30 Mbps when 15 decoding iterations are carried out.

IEEE Transactions on Circuits and Systems I Regular Papers•Nov 30, 2010•58 citations

Min–Max Decoding for Non-Binary LDPC Codes

Leilei Yang, Fei Liu, Haitao Li

Lecture notes in electrical engineering•Nov 5, 2012•5 citations

Multiple-Vote Symbol-Flipping Decoder for Nonbinary LDPC Codes

Francisco García-Herrero, Erbao Li, David Declercq +1 more

A multiple-vote symbol-flipping (MV-SF) decoding algorithm for nonbinary low-density parity-check (NB-LDPC) codes is proposed in this paper. Our algorithm improves the generalized bit-flipping algorithm (GBFDA) by considering the multiplicity of the candidates at the check-node output, to perform a more accurate symbol-flipping decision at the variable node update. The MV-SF algorithm greatly improves the frame error rate performance of GBFDA and approaches the performance of the best state-of-the-art decoders [extended min-sum and min-max (Min–Max)] with lower complexity. For a$(N=837,K=723)$NB-LDPC code over GF(32), the decoder derived from the proposed algorithm can reach a throughput higher than 500 Mb/s and a coding gain of 0.44 dB compared with the most efficient GBFDA architecture with only twice the silicon area. Our architecture has 27% efficiency gain compared with the best Min–Max architecture found in the literature, with a performance loss of just 0.21 dB at frame error rate$10^{-4}$.

IEEE Transactions on Very Large Scale Integration (VLSI) Systems•Feb 4, 2014•14 citations

A Parallel Layered Decoding Algorithm for Non-layered LDPC Codes

Kun Guo, Yong Hei, Yumei Zhou +1 more

该文针对不可分层LDPC码无法利用分层算法进行译码的问题，提出了一种并行分层置信度传播(Parallel-Layered Belief-Propagation，PLBP)译码算法。与传统分层算法不同，该算法在译码时并行进行各层更新，串行进行层内各行更新。这种译码机制使得同一变量节点在各层内不同时进行更新，从而实现各变量节点在一次迭代中分层递进更新的算法目标。仿真表明，在不增加译码复杂度的情况下，该文提出的PLBP算法与传统的洪水算法相比，误码性能更优，而且所需要的平均迭代次数降低了约50%。此外，PLBP算法采用了合并的节点更新运算，最终使该算法达到的译码速度约为洪水算法的4倍。

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Aug 27, 2010•0 citations

Novel modified min-sum decoding algorithm for low-density parity-check codes

Liu, Haiyang, Qu +7 more

改进低密度的同等值检查(LDPC ) 译码编码的 min 和的表演的问题在这份报纸被考虑。把算法基于 min 和，为 LDPC 代码译码算法的新奇修改 min 和被建议。如果他们的符号是不同的，建议算法由平均新消息和以前的消息在重复进程修改可变节点消息。与标准 min 和算法相比，修正随仅仅复杂性的小增加被完成，但是显著地改善为常规、不规则的 LDPC 代码译码性能。模拟结果证明我们译码算法修改的性能离为中等长度 LDPC 代码的标准和产品算法的很靠近。

中国邮电高校学报：英文版•Jan 1, 2010•1 citation
摘要: 该文在现有译码算法的基础上提出一种高效的非二进制低密度奇偶校验码(NB-LDPC)译码方法，充分利用了分层译码算法与Min-max算法的优点，不但译码复杂度低、需要的存储空间小，而且可将译码速度提高一倍。应用该算法，对一种定义在GF(25)上的(620,509)码进行了仿真。该码的仿真结果表明：在相同误码率下，该文译码算法所需最大迭代次数仅为Zhang的算法(2011)的45%。 关键词: 非二进制低密度奇偶校验码(NB-LDPC) / 分层译码 / Min-max / 准循环码
摘要: 为了降低多进制低密度奇偶校验(Low-Density Parity-Check,LDPC)码译码算法的复杂度,该文提出了基于新停止准则的符号翻转译码算法。该算法根据翻转函数和接收比特可靠性度量来确定对应的翻转符号,通过分析不满足校验方程个数的变化趋势来提前终止迭代。仿真结果表明,新算法在保持原有符号翻转译码算法误码性能不变的情况下,极大地减少了译码迭代次数,取得了译码性能和复杂度的折衷。 关键词: 多进制低密度奇偶校验码 / 符号翻转译码 / 停止准则 / 环路检测 / 有限域
Nonbinary low-density parity-check (NB-LDPC) codes constructed over GF(q) (q >; 2) can achieve higher coding gain than binary LDPC codes when the code length is moderate. A complete partial-parallel decoder architecture based on the Min-max algorithm is proposed for quasi-cyclic NB-LDPC codes in this paper. A novel scheme and corresponding architecture are developed to implement the elementary step of the check node processing. In our design, layered decoding is applied and only nm5) has also been synthesized on a Xilinx Virtex-2 Pro FPGA device. It can achieve a throughput of 9.30 Mbps when 15 decoding iterations are carried out.
A multiple-vote symbol-flipping (MV-SF) decoding algorithm for nonbinary low-density parity-check (NB-LDPC) codes is proposed in this paper. Our algorithm improves the generalized bit-flipping algorithm (GBFDA) by considering the multiplicity of the candidates at the check-node output, to perform a more accurate symbol-flipping decision at the variable node update. The MV-SF algorithm greatly improves the frame error rate performance of GBFDA and approaches the performance of the best state-of-the-art decoders [extended min-sum and min-max (Min–Max)] with lower complexity. For a(N=837,K=723)(N=837,K=723)(N=837,K=723)NB-LDPC code over GF(32), the decoder derived from the proposed algorithm can reach a throughput higher than 500 Mb/s and a coding gain of 0.44 dB compared with the most efficient GBFDA architecture with only twice the silicon area. Our architecture has 27% efficiency gain compared with the best Min–Max architecture found in the literature, with a performance loss of just 0.21 dB at frame error rate10−410^{-4}10−4.
该文针对不可分层LDPC码无法利用分层算法进行译码的问题，提出了一种并行分层置信度传播(Parallel-Layered Belief-Propagation，PLBP)译码算法。与传统分层算法不同，该算法在译码时并行进行各层更新，串行进行层内各行更新。这种译码机制使得同一变量节点在各层内不同时进行更新，从而实现各变量节点在一次迭代中分层递进更新的算法目标。仿真表明，在不增加译码复杂度的情况下，该文提出的PLBP算法与传统的洪水算法相比，误码性能更优，而且所需要的平均迭代次数降低了约50%。此外，PLBP算法采用了合并的节点更新运算，最终使该算法达到的译码速度约为洪水算法的4倍。
改进低密度的同等值检查(LDPC ) 译码编码的 min 和的表演的问题在这份报纸被考虑。把算法基于 min 和，为 LDPC 代码译码算法的新奇修改 min 和被建议。如果他们的符号是不同的，建议算法由平均新消息和以前的消息在重复进程修改可变节点消息。与标准 min 和算法相比，修正随仅仅复杂性的小增加被完成，但是显著地改善为常规、不规则的 LDPC 代码译码性能。模拟结果证明我们译码算法修改的性能离为中等长度 LDPC 代码的标准和产品算法的很靠近。