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

基于RMP调度的简化差分域LDPC译码算法

雷海军, 刘鹏, 何业军, 谢莲花

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

针对对数域和积LDPC(Low Density Parity Check Codes)译码算法复杂度高和译码采用的SMP(Standard Message Passing)调度算法收敛速度慢的问题,提出基于RMP(RowMessage Passing)调度的简化差分域LDPC译码算法.用RMP调度优化变量节点信息更新使收敛速度提高一倍.由于在Tanner图上传递的是概率的差分值,并且在校验节点信息更新时选择w个绝对值最小的差分值进行,降低了算法复杂度.实验表明本文算法在不降低译码性能条件下降低了算法复杂度,提高了算法收敛速度.

Related papers

非规则LDPC码随机性结构的分布规律研究和在短环消除算法中的应用

义林 常, 林华 马, 晟达 王

Science in China Series F-Information Sciences (in Chinese)•Apr 1, 2007•0 citations

A New Early Termination Strategy for QC-LDPC Codes Based on the Layered Message Passing Decoding

Zhejun Zhang, Guanghui He, Jun Ma

Low-density parity-check (LDPC) codes are one of the most popular linear block codes have ever been used in the communication system.The standard two-phase message passing decoding (TPMPD) algorithm and the layered message-passing decoding (LMPD) algorithm are widely used in LDPC decoder.However, the convergence speed of LMPD algorithm is much faster than that of TPMPD algorithm, particularly in the condition of high signal noise ratio (SNR).In this paper, we propose an early termination criterion for quasi-cyclic low-density parity-check (QC-LDPC) codes based on LMPD algorithm with fast convergence speed.The strategy is to dynamically reprocesses the uncorrected related layers while skipping the corrected ones.Simulations show that 3% reduction in terms of iteration numbers can be achieved with no performance loss compared to the traditional termination strategies, such as hard decision aided (HDA) strategy and parity check equations (PCE) strategy.Furthermore, the optimized early termination strategy achieves low complexity in hardware implementation.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2013•1 citation

Symbol Message Passing Decoding of Nonbinary Spatially-Coupled Low-Density Parity-Check Codes

Emna Ben Yacoub, Francisco Lázaro, Alexandre Graell i Amat +1 more

The performance of a decoding algorithm, called symbol message passing (SMP), is analyzed for nonbinary spatially coupled low-density parity-check (LDPC) codes. The SMP algorithm can be seen as a generalization of Gallager B and the binary message passing algorithm by Lechner et al. to q-ary LDPC codes. The analysis is performed via density evolution over the q-ary symmetric channel, with q being the field order used for the code construction.

AEIT International Annual Conference•Sep 1, 2019•1 citation

基于改进型UMP BP—Based算法的LDPC译码研究

张天瑜

为了弥补UMPBP—Based译码算法相对于LLRBP译码算法的性能缺陷,提出一种改进型UMPBP—Based译码算法。该算法中的参数是在最小均方误差准则下确定的,对所有的LDPC码的译码具有通用性。仿真结果表明,在相同误码率的情。况下,改进型UMPBP—Based译码算法比UMPBP—Based译码算法、NormalizedBP—Based译码算法以及OffsetBP—Based译码算法具有更好的LDPC译码性能。

Microcomputer & its Applications•Jan 1, 2010•0 citations

On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization

Mohsen Moradi, Sheida Rabeti, Hessam Mahdavifar

Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes.

arXiv:2506.11345•Jun 12, 2025•0 citations

改进的基于剩余度置信度传播的 LDPC 解码算法

赵明, 张晓林

低密度奇偶校验(LDPC,Low—Density Parity—Check)码的剩余度置信度传播(RBP,Residual Belief—Propagation)和基于行的剩余度置信度传播(NWRBP,Node-Wise RBP)解码算法的性能提升非常有限且计算复杂度较高.提出改进的RBP(ERBP,Enhanced RBP)算法,在一个子迭代中,仅更新一个消息,然后设置被更新消息所在行的所有节点的剩余度值为0,使得ERBP解码算法在每个子迭代中使用不同行的消息进行计算,以加速迭代收敛.不同的LDPC码用于对所提出的算法进行性能仿真.仿真结果表明,与其他算法相比,ERBP算法降低了误帧率(FER,Frame Error Ratio),并加快了迭代收敛速度。

北京航空航天大学学报•Jan 1, 2014•0 citations
针对对数域和积LDPC(Low Density Parity Check Codes)译码算法复杂度高和译码采用的SMP(Standard Message Passing)调度算法收敛速度慢的问题,提出基于RMP(RowMessage Passing)调度的简化差分域LDPC译码算法.用RMP调度优化变量节点信息更新使收敛速度提高一倍.由于在Tanner图上传递的是概率的差分值,并且在校验节点信息更新时选择w个绝对值最小的差分值进行,降低了算法复杂度.实验表明本文算法在不降低译码性能条件下降低了算法复杂度,提高了算法收敛速度.
Low-density parity-check (LDPC) codes are one of the most popular linear block codes have ever been used in the communication system.The standard two-phase message passing decoding (TPMPD) algorithm and the layered message-passing decoding (LMPD) algorithm are widely used in LDPC decoder.However, the convergence speed of LMPD algorithm is much faster than that of TPMPD algorithm, particularly in the condition of high signal noise ratio (SNR).In this paper, we propose an early termination criterion for quasi-cyclic low-density parity-check (QC-LDPC) codes based on LMPD algorithm with fast convergence speed.The strategy is to dynamically reprocesses the uncorrected related layers while skipping the corrected ones.Simulations show that 3% reduction in terms of iteration numbers can be achieved with no performance loss compared to the traditional termination strategies, such as hard decision aided (HDA) strategy and parity check equations (PCE) strategy.Furthermore, the optimized early termination strategy achieves low complexity in hardware implementation.
Recently introduced Fair-Density Parity-Check (FDPC) codes, targeting high-rate applications, offer superior error-correction performance (ECP) compared to 5G Low-Density Parity-Check (LDPC) codes, given the same number of message-passing decoding iterations. In this paper, we present a novel construction method for FDPC codes, introduce a generalization of these codes, and propose a low-complexity encoding algorithm. Numerical results demonstrate the fast convergence of the message-passing decoder for FDPC codes.
低密度奇偶校验(LDPC,Low—Density Parity—Check)码的剩余度置信度传播(RBP,Residual Belief—Propagation)和基于行的剩余度置信度传播(NWRBP,Node-Wise RBP)解码算法的性能提升非常有限且计算复杂度较高.提出改进的RBP(ERBP,Enhanced RBP)算法,在一个子迭代中,仅更新一个消息,然后设置被更新消息所在行的所有节点的剩余度值为0,使得ERBP解码算法在每个子迭代中使用不同行的消息进行计算,以加速迭代收敛.不同的LDPC码用于对所提出的算法进行性能仿真.仿真结果表明,与其他算法相比,ERBP算法降低了误帧率(FER,Frame Error Ratio),并加快了迭代收敛速度。