A new forced convergence decoding scheme for LDPC codes

In this paper, we present a new forced convergence decoding scheme for LDPC codes. We remove the early detected variable nodes from the Tanner graph and thus the parity matrix shrinks iteration by iteration and the decoding complexity can be reduced. When the parity check matrix shrinks to zero befo...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Conference on Communication Technology and Applications pp. 576 - 580
Main Authors Jianxiao Fan, Hongwen Yang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2009
Subjects
Convergence
deleting
Equations
Error analysis
Forced Convergence
Iterative algorithms
Iterative decoding
Joining processes
LDPC
Low Complexity
Message passing
Mobile handsets
Parity check codes
Wireless communication
Online AccessGet full text
ISBN1424448166
9781424448166
DOI10.1109/ICCOMTA.2009.5349137

Cover

More Information
Summary:In this paper, we present a new forced convergence decoding scheme for LDPC codes. We remove the early detected variable nodes from the Tanner graph and thus the parity matrix shrinks iteration by iteration and the decoding complexity can be reduced. When the parity check matrix shrinks to zero before the maximum iteration, we get a chance to detect the wrong deletion and, for the decodable codewords, most of such failure can be recovered by restoring the original Tanner graph and resuming the decoding in the remaining iterations. Simulations results indicate that the proposed method can reduce the decoding complexity significantly while keep the error rate performance unchanged or even better.
ISBN:1424448166
9781424448166
DOI:10.1109/ICCOMTA.2009.5349137