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

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 pr...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 59; číslo 1; s. 64 - 73
Hlavní autoři:	Kang, Jingyu, Huang, Qin, Lin, Shu, Abdel-Ghaffar, Khaled
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.01.2011 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Applied sciences AWGN backtracking Breaking Charge carrier processes Codes Coding, codes Computer simulation Decoders Decoding error-floor Exact sciences and technology Failure Graphs Information, signal and communications theory Iterative decoding LDPC code Low density parity check codes Maximum likelihood decoding message-passing algorithm Signal and communications theory Signal to noise ratio Telecommunications and information theory Trapping trapping set Performance evaluation Error estimation Bit error rate Tanner graph Iterative method error-floor message-passing algorithm Algorithm Failures Iterative decoding Trapping Message passing Simulation Analytical method Error correcting code Parity check codes backtracking LDPC code Low bit rate trapping set
ISSN:	0090-6778, 1558-0857
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ISSN:	0090-6778 1558-0857
DOI:	10.1109/TCOMM.2010.101210.090628