Reliability-Based Iterative Decoding of LDPC Codes Using Likelihood Accumulation

In this work, we present an improvement on low complexity serial concatenation of belief propagation (BP) - order statistic decoding (OSD) algorithm for low-density parity-check (LDPC) codes. We introduce a more reliable method to reconstruct ordered information sequence in terms of the accumulated log-likelihood ratio (LLR) transitions of variable nodes. We give a general expression for both the existing BP-OSD algorithm and our proposed new method according to a structure similar to an infinite impulse response (IIR) filter. This improved algorithm achieves noticeable performance gains with only modest increase in computation complexity.

[1]  Tomoaki Ohtsuki,et al.  Decoding Algorithms Based on Oscillation for Low-Density Parity Check Codes , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[2]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..

[3]  Hideki Imai,et al.  On the suboptimality of iterative decoding for turbo-like and LDPC codes with cycles in their graph representation , 2004, IEEE Transactions on Communications.

[4]  Virtual Bridged,et al.  IEEE Standards for Local and Metropolitan Area Networks: Specification for 802.3 Full Duplex Operation , 1997, IEEE Std 802.3x-1997 and IEEE Std 802.3y-1997 (Supplement to ISO/IEC 8802-3: 1996/ANSI/IEEE Std 802.3, 1996 Edition).

[5]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.