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

Two Methods for Reducing the Error-Floor of LDPC Codes

Stefan Laendner, Thorsten Hehn, Olgica Milenković, Johannes B. Huber

Published Jul 13, 2007• 4 citations
OpenAlex

Related papers

Advances of the error-floor study of LDPC codes

Jiwen Zeng

Low-density parity check(LDPC)codes are known to perform very well under iterative decoding.However,these codes often exhibit an error floor phenomenon in the high signal-to-noise(SNR)region.This paper provides a comprehensive description of the cause of the error floor phenomenon of LDPC codes.It presents a detailed description of the trapping sets,describes the methods to estimate and reduce the error floor of LDPC codes.Finally,it proposes the future development of the error floor of LDPC codes.

Information technology newsletter•Jan 1, 2009•0 citations

Lowering the Error Floor of LDPC Codes Based on Bit-Rectification Strategy

Hui Xue, Lijun Zhang

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)•Jan 1, 2019•0 citations

Lowering Error Floor of LDPC Codes: A Machine Learning Approach

Jeongseok Ha, Seokju Han, Kyungmok Oh +1 more

•Mar 10, 2019•0 citations

Lowering the error floor of ADMM penalized decoder for LDPC codes

Xiaopeng Jiao, Jianjun Mu

Decoding by alternating direction method of multipliers (ADMM) is a promising linear programming decoder for low-density parity-check (LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder. For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.

China Communications•Aug 1, 2016•5 citations

Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure

Juane Li, Keke Liu, Shu Lin +1 more

Presented in this paper is a reduced-complexity iterative decoding scheme for quasi-cyclic (QC) LDPC codes. This decoding scheme is devised based on the section-wise cyclic structure of the parity-check matrix of a QC-LDPC code. Using this decoding scheme, the hardware implementation complexity of a QC-LDPC decoder can be significantly reduced without performance degradation. A high-rate QC-LDPC code that can achieve a very low error-rate without a visible error-floor is used to demonstrate the effectiveness of the proposed decoding scheme. Also presented in this paper are two other high-rate QC-LDPC codes and a method for constructing rate -1/2 QC-LDPC codes whose Tanner graphs have girth 8. All the codes constructed perform well with low error-floor using the proposed decoding scheme.

Information Theory and Applications Workshop (ITA)•Feb 1, 2014•25 citations

On the Construction and Performance of LDPC Codes

B. N. Sindhu Tejaswini, Rajendra Prasad Lal, Vadlamudi Ch. Venkaiah

Lecture notes in networks and systems•Jan 1, 2017•0 citations
Low-density parity check(LDPC)codes are known to perform very well under iterative decoding.However,these codes often exhibit an error floor phenomenon in the high signal-to-noise(SNR)region.This paper provides a comprehensive description of the cause of the error floor phenomenon of LDPC codes.It presents a detailed description of the trapping sets,describes the methods to estimate and reduce the error floor of LDPC codes.Finally,it proposes the future development of the error floor of LDPC codes.
Decoding by alternating direction method of multipliers (ADMM) is a promising linear programming decoder for low-density parity-check (LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder. For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.
Presented in this paper is a reduced-complexity iterative decoding scheme for quasi-cyclic (QC) LDPC codes. This decoding scheme is devised based on the section-wise cyclic structure of the parity-check matrix of a QC-LDPC code. Using this decoding scheme, the hardware implementation complexity of a QC-LDPC decoder can be significantly reduced without performance degradation. A high-rate QC-LDPC code that can achieve a very low error-rate without a visible error-floor is used to demonstrate the effectiveness of the proposed decoding scheme. Also presented in this paper are two other high-rate QC-LDPC codes and a method for constructing rate -1/2 QC-LDPC codes whose Tanner graphs have girth 8. All the codes constructed perform well with low error-floor using the proposed decoding scheme.