An Efficient Decoding Algorithm for Low-Density Parity-Check Codes

Yang CAO  Xiuming SHAN  Yong REN  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A   No.5   pp.1384-1387
Publication Date: 2005/05/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.5.1384
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Coding Theory
Keyword: 
LDPC codes,  iterative decoding,  bit-flipping,  belief propagation and bipartite graph,  

Full Text: PDF(171.2KB)>>
Buy this Article




Summary: 
We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.