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

IEEE Communications Letters

An Imprecise Stopping Criterion Based on In-Between Layers Partial Syndromes

David Declercq, Valentin Savin, Oana Boncalo, Fakhreddine Ghaffari

Published Jun 22, 2017• 6 citations
Publisher

Abstract

In this letter, we address the issue of early stopping criterion for layered LDPC decoders, aiming at more safeness with low hardware cost and minimum latency. We introduce a new on-the-fly measure in the decoder, called in-between layers partial syndrome, and define a family of stopping criteria, with different tradeoffs among complexity, latency, and performance. Numerical results show that our stopping criteria surpass existing solutions, and can be as safe as the full-syndrome detection, down to frame error rates (FERs) as low as FER = 10-8.

DOI
10.1109/lcomm.2017.2718523

Related papers

Analysis and implementation of on-the-fly stopping criteria for layered QC LDPC decoders

Andrei Hera, Oana Boncalo, Constantina‐Elena Gavriliu +4 more

This paper presents an analysis of existing stopping criteria for layered architecture used for quasi-cyclic (QC) LDPC decoders. Furthermore, it proposes a novel imprecise method for early termination in layered decoders. The analysis is performed under the same framework in order to provide a fair and accurate comparison between existing methods, and our new solution. The developed hardware modules have been designed independently from the decoder architecture, with the only constraint that the decoder scheduling is layered. Synthesis estimates for Xilinx Virtex-7 devices and the decoding performance analysis indicate that the new stopping criterion presents the best cost/performance trade-off for most of the considered LDPC codes.

International Conference Mixed Design of Integrated Circuits and Systems•Jun 1, 2015•4 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

Ultra-low complexity early termination scheme for layered LDPC decoding

Yuan‐Syun Wu, Cheng-Hung Dixson Lin, Shu-Yen Lin

Energy consumption is a major issue for LDPC decoding. To save LDPC iterative process energy, early terminations are commonly used. Traditional parity check equation is used but has a growing complexity as the block size increases. This requires a large overhead in term of area. This paper proposes an ultra-low complexity early termination (ET) scheme with a small loss of bit error rate performance based on the layer stopping (LS) criterion. The proposed ET scheme is performed by checking the number of convergent layers stopped by the LS criterion with a preset threshold. Compared with other ET schemes, the proposed ET scheme has a negligible hardware overhead and an acceptable bit error rate performance.

IEEE Global Conference on Consumer Electronics (GCCE)•Oct 1, 2014•2 citations

An efficient early stopping analog decoder for LDPC codes

Yuan Gao, Yujie Lin, Bowen Zeng +2 more

The analog implementation of error control decoders is a competitive methodology compared with the digital implementation in power efficiency and throughput. In order to detect uncorrectable frames and early stop the iterative decoding of low-density parity check (LDPC) analog decoders, a probability stopping block using probabilities of satisfied checks is proposed. Simulation results show that the proposed criterion can greatly reduce the average number of iterations at low SNR, and has better tradeoff between complexity and performance than other stopping criteria using extrinsic information.

International Conference on Computer Science and Network Technology (ICCSNT)•Dec 1, 2015•1 citation

An efficient stopping criterion of LDPC decoding for optical transmission

Ming Jiang, Jinfang Dou

The stopping criterion based on parity-check constraints is an inherent advantage of low-density parity-check (LDPC) codes. However, the parity-check computation with signs of the posterior information costs additional hardware or decoding delays, which may be a particular problem for the full-parallel LDPC decoding in optical transmission. Furthermore, the performance degradation caused by using simplified stopping criterions should also be considered, where the maximum number of the iterations is usually limited by the very high decoding speed in optical transmission. In this paper, we propose an efficient early stopping criterion with the consideration of the complexity/performance tradeoffs. The new method is based an intelligent combination of check equations and temporary hard decisions, and can be pipelined with check-node updating, thus leading to lower complexity and power consumption, which are desirable for both optical and wireless communications. Simulation results show that the hybrid criterion not only achieves the same performance as the conventional stopping criterions, but also provides a noticeable gain for the other simplified stopping criterions.

International Conference on Optical Communications and Networks (ICOCN)•Jan 1, 2010•5 citations

Low Complexity Stopping Criterion for LDPC Code Decoders

Frank Kienle, Norbert Wehn

Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.

IEEE Vehicular Technology Conference•Dec 10, 2005•67 citations
In this letter, we address the issue of early stopping criterion for layered LDPC decoders, aiming at more safeness with low hardware cost and minimum latency. We introduce a new on-the-fly measure in the decoder, called in-between layers partial syndrome, and define a family of stopping criteria, with different tradeoffs among complexity, latency, and performance. Numerical results show that our stopping criteria surpass existing solutions, and can be as safe as the full-syndrome detection, down to frame error rates (FERs) as low as FER = 10-8.
This paper presents an analysis of existing stopping criteria for layered architecture used for quasi-cyclic (QC) LDPC decoders. Furthermore, it proposes a novel imprecise method for early termination in layered decoders. The analysis is performed under the same framework in order to provide a fair and accurate comparison between existing methods, and our new solution. The developed hardware modules have been designed independently from the decoder architecture, with the only constraint that the decoder scheduling is layered. Synthesis estimates for Xilinx Virtex-7 devices and the decoding performance analysis indicate that the new stopping criterion presents the best cost/performance trade-off for most of the considered LDPC codes.
Energy consumption is a major issue for LDPC decoding. To save LDPC iterative process energy, early terminations are commonly used. Traditional parity check equation is used but has a growing complexity as the block size increases. This requires a large overhead in term of area. This paper proposes an ultra-low complexity early termination (ET) scheme with a small loss of bit error rate performance based on the layer stopping (LS) criterion. The proposed ET scheme is performed by checking the number of convergent layers stopped by the LS criterion with a preset threshold. Compared with other ET schemes, the proposed ET scheme has a negligible hardware overhead and an acceptable bit error rate performance.
The analog implementation of error control decoders is a competitive methodology compared with the digital implementation in power efficiency and throughput. In order to detect uncorrectable frames and early stop the iterative decoding of low-density parity check (LDPC) analog decoders, a probability stopping block using probabilities of satisfied checks is proposed. Simulation results show that the proposed criterion can greatly reduce the average number of iterations at low SNR, and has better tradeoff between complexity and performance than other stopping criteria using extrinsic information.
The stopping criterion based on parity-check constraints is an inherent advantage of low-density parity-check (LDPC) codes. However, the parity-check computation with signs of the posterior information costs additional hardware or decoding delays, which may be a particular problem for the full-parallel LDPC decoding in optical transmission. Furthermore, the performance degradation caused by using simplified stopping criterions should also be considered, where the maximum number of the iterations is usually limited by the very high decoding speed in optical transmission. In this paper, we propose an efficient early stopping criterion with the consideration of the complexity/performance tradeoffs. The new method is based an intelligent combination of check equations and temporary hard decisions, and can be pipelined with check-node updating, thus leading to lower complexity and power consumption, which are desirable for both optical and wireless communications. Simulation results show that the hybrid criterion not only achieves the same performance as the conventional stopping criterions, but also provides a noticeable gain for the other simplified stopping criterions.
Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.