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

Lecture Notes on Information Theory

An Early Termination Criterion for Stochastic LDPC Decoding

Huiming Dai, Qiangze Chi, Hao Yan, Xin Zhang, Dacheng Yang

Published Jan 1, 2016• 0 citations
Publisher
DOI
10.18178/lnit.4.1.7-12

Related papers

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

Yuan‐Syun Wu, Cheng-Hung Dixson Lin

•Aug 5, 2014•0 citations

Efficient Early Termination Criterion for ADMM Penalized LDPC Decoder

Biao Wang, Xiaopeng Jiao, Jianjun Mu +1 more

By tracking the changing rate of hard decisions during every two consecutive iterations of the alternating direction method of multipliers (ADMM) penalized decoding, an efficient early termination (ET) criterion is proposed to improve the convergence rate of ADMM penalized decoder for low-density parity-check (LDPC) codes. Compared to the existing ET criterion for ADMM penalized decoding, the proposed method can reduce the average number of iterations significantly at low signal-to-noise ratios with negligible performance degradation.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2018•2 citations

Stochastic Decoders for LDPC Codes

François Leduc-Primeau, Vincent Gaudet, Warren J. Gross

Springer eBooks•Oct 17, 2014•2 citations

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

Miroslav Marinkovic, Eckhard Grass, Milos D. Krstic

International Symposium on Wireless Communication Systems•Oct 15, 2013•2 citations

Probability stopping criterion for analog decoding of LDPC codes

Hao Ran Zheng, Zhang Shuyi, Lintao Li +2 more

中国邮电高校学报：英文版•Feb 1, 2017•2 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
By tracking the changing rate of hard decisions during every two consecutive iterations of the alternating direction method of multipliers (ADMM) penalized decoding, an efficient early termination (ET) criterion is proposed to improve the convergence rate of ADMM penalized decoder for low-density parity-check (LDPC) codes. Compared to the existing ET criterion for ADMM penalized decoding, the proposed method can reduce the average number of iterations significantly at low signal-to-noise ratios with negligible performance degradation.
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.