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

International Symposium on Wireless Communication Systems

An Early Termination Strategy for Irregular LDPC Codes with Layered Decoding - Performance Evaluation and Implementation

Miroslav Marinkovic, Eckhard Grass, Milos D. Krstic

Published Oct 15, 2013• 2 citations
OpenAlex

Related papers

Low-cost layer-based early termination scheme for LDPC decoding

Yuan‐Syun Wu, Cheng-Hung Dixson Lin

•Aug 5, 2014•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

Construction of LDPC Codes for the Layered Decoding Algorithm

Wang, Dong, Mingke +5 more

China Communications•Jan 1, 2012•1 citation

Modified layered message passing decoding with dynamic scheduling and early termination for QC-LDPC codes

Yeong-Luh Ueng, Yu-Lun Wang, Chi-Yu Lin +2 more

The convergence speed of layered message-passing decoding (LMPD) is faster than that of standard two phase message passing (TPMP) decoding. We propose to use dynamic scheduling and early termination to reduce computational complexity for a modified LMPD algorithm which was proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. We dynamically skip or redo the decoding operations for some layers based on appropriate criteria. An early termination strategy which is efficient in hardware implementation is also proposed in this paper. The modified MPD using these two techniques simultaneously can reduce the computational complexity with similar error performance as compared to the case of not using these two techniques.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2009•9 citations

Safe Early Stopping for Layered LDPC Decoding

Marco Ferrari, S. Bellini, Alessandro Tomasoni

In this letter, we address the problem of early stopping of iterative decoding of LDPC codes, driven by criteria ensuring that no errors occur from premature termination. A safe termination strategy developed for Turbo codes is generalized to layered LDPC decoding. Then, a more efficient version and also two less efficient, but less complex, criteria are proposed.

IEEE Communications Letters•Dec 30, 2014•15 citations

Early Detection Algorithm for Decoding LDPC Codes

Ho-Il Kim

한국통신학회 학술대회 및 강연회•Apr 1, 2004•4 citations
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.
The convergence speed of layered message-passing decoding (LMPD) is faster than that of standard two phase message passing (TPMP) decoding. We propose to use dynamic scheduling and early termination to reduce computational complexity for a modified LMPD algorithm which was proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. We dynamically skip or redo the decoding operations for some layers based on appropriate criteria. An early termination strategy which is efficient in hardware implementation is also proposed in this paper. The modified MPD using these two techniques simultaneously can reduce the computational complexity with similar error performance as compared to the case of not using these two techniques.