Globecom

A Two-Stage Iterative Decoding of LDPC Codes for Lowering Error Floors

Jingyu Kang, Li Guo Zhang, Zhi Jun Ding, Shu Lin

Published Jan 1, 2008• 16 citations

Abstract

In iterative decoding of LDPC codes, trapping sets often lead to high error floors. In this work, we propose a two-stage iterative decoding to break trapping sets. Simulation results show that the error floor performance can be significantly improved with this decoding scheme.

DOI: 10.1109/glocom.2008.ecp.215

Related papers

An improved two-stage iterative decoding of LDPC codes for Lowering error floors

Shuo-chen Wang, Atabaev Doniyor, Heejong Suh

In iterative decoding of LDPC codes ,from the phenomenon of error floors of LDPC code is mostly caused by an undesirable structure ,know as trapping set. In this paper, we propose a improved two-stage iterative decoding to break trapping sets. This algorithm is not need to observe all the error, only need to break which trapping set effect the effectiveness. Simulation results show that the error floor performance can be significantly improved with this decoding scheme.

대한전자공학회 학술대회Jun 1, 20140 citations

An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes

Jingyu Kang, Qin Huang, Shu Lin +1 more

Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and prevents decoding from converging to the correct codeword. A technique is proposed to break trapping sets while decoding. Based on decoding results leading to a decoding failure, some bits are identified in a previous iteration and flipped and decoding is restarted. This backtracking may enable the decoder to get out of the trapped state. A semi-analytical method is also proposed to predict the error-floor after backtracking. Simulation results indicate the effectiveness of the proposed technique in lowering the error-floor. The technique, which has moderate complexity overhead, is applicable to any code without requiring a prior knowledge of the structure of its trapping sets.

IEEE Transactions on CommunicationsOct 27, 201045 citations

A Two-Stage Decoding Algorithm to Lower the Error-Floors for LDPC Codes

Xueting Zhang, Shaoping Chen

A two-stage decoding algorithm to lower the error-floor for low-density parity-check (LDPC) codes is presented. An efficient stopping criterion is proposed to avoid unnecessary iterations in the first stage. If the stopping criterion is reached, the first stage decoding will be terminated and the second stage decoding will be started, where the unsuccessfully decoded words are re-decoded by manipulating the log-likelihood ratio (LLR) of two types of specifically selected variable nodes. Simulation results show that the proposed algorithm can effectively lower the error floor of LDPC codes while maintaining a low decoding complexity.

IEEE Communications LettersFeb 9, 201512 citations

An Effective Decoding Algorithm of LDPC Codes with Lowering Error Floors

Shuo-Chen Wang, Heejong Suh

본 논문에서는, LDPC 코드의 성능을 향상시키기 위해서, LDPC 코드의 에러 플로어(error floors)를 낮추어서 복호를 수행하는 효율 좋은 알고리듬을 제안한다. 이 방법은, 바람직하지 않은 구조 때문인데, Tanner 그래프의 트래핑 세트를 줄여서 복호를 하는 방법이다. 이 알고리듬은 트래핑 세트를 줄이는 방법으로 복호의 효율성을 얻는다. 모의시험을 통해서 이 알고리듬의 개선된 성능을 확인 할 수 있었다. In this paper, in order to improve performance of LDPC codes, we propose an effective algorithm with lowering error floor of LDPC codes. This method is done by breaking trapping sets, mostly caused by an undesirable structure. This algorithm is not need to observe all the errors, only need to break the trapping sets, to effect the effectiveness. Simulation results show that its performance can be significantly improved with this decoding algorithm.

The Journal of the Korea institute of electronic communication sciencesOct 31, 20141 citation

A fixed bits LDPC decoder

Fen Xu, Liang Zhou, Hong Wen +2 more

With iterative decoding, most LDPC codes have a weakness known as error floor. In this work, we propose a fixed bits LDPC decoding scheme to improve the ability of LDPC transmission. The method is universal as it can be applied to any code/channel model/decoding algorithm and it improves performance greatly, without losing the code regularity, without changing the decoding algorithm. Simulation results show that the error floor performance also can be significantly improved with this decoding scheme.

International Conference on Electronics and Information EngineeringAug 1, 20100 citations

An efficient post processing scheme to lower the error floor of LDPC decoders

Wenjie Li, Jun Ting Lin, Zhongfeng Wang

Low-Density Parity-Check (LDPC) codes have extensive applications in numerous communication systems. However, iterative LDPC decoders may suffer from error floor. In this paper, a low complexity post processing scheme (PPS) is proposed to significantly improve the error correction performance of a Min-Sum based LDPC decoder in the error floor region. Instead of using trapping set elimination algorithms, the proposed PPS introduces perturbations so that a decoder can escape from undesired local maximums. After decoding failure, for these unreliable code bits, the proposed PPS generates carefully modified soft messages, which are employed in the following decoding iterations. Numerical results demonstrate that the presented PPS significantly lowers the error floor for simulated LDPC codes.

IEEE International Conference on Communication Technology (ICCT)Oct 1, 20174 citations