Paper Info
Title
An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes
Abstract
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.
Year
DOI
Venue
2011
10.1109/TCOMM.2010.101210.090628
IEEE Transactions on Wireless Communications
Keywords
Field
DocType
complexity overhead,backtracking,ldpc codes,error floor,message-passing algorithm,error-floor,tanner graphs,trapping set,trapping sets,iterative decoding algorithm,trapped state,decoding failure,graph theory,message passing,iterative decoding,ldpc code,parity check codes,signal to noise ratio,bit error rate,awgn
Concatenated error correction code,Sequential decoding,Berlekamp–Welch algorithm,Low-density parity-check code,Computer science,Serial concatenated convolutional codes,Algorithm,Tanner graph,Decoding methods,List decoding
Journal
Volume
Issue
ISSN
59
1
0090-6778
Citations 
PageRank 
References 
17
0.83
13
Authors
4
Name
Order
Citations
PageRank
Jingyu Kang11378.11
Qin Huang235534.55
Shu Lin323416.88
Khaled A. S. Abdel-Ghaffar4616122.03