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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 59; no. 1; pp. 64 - 73
Main Authors:	Kang, Jingyu, Huang, Qin, Lin, Shu, Abdel-Ghaffar, Khaled
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.01.2011 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!