Research of Low-Density Parity-Check Decode Algorithms for Digital Subscriber Lines

Decoding algorithm complexity influences the application of low-density parity-check (LDPC) codes. This article investigated the Belief-Propagation and improved decode algorithms for a subclass of binary LDPC that can be encoded linearly. Through the comparison of decoding performance, a low complexity one with good performance is preferred. It is shown that the incorporation of LDPC coding techniques into Digital Subscriber Line (DSL) systems appears to be possible.

[1]  J. Chen,et al.  Near optimum universal belief propagation based decoding of LDPC codes and extension to turbo decoding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[2]  Ajay Dholakia,et al.  Reduced-complexity decoding algorithm for low-density parity-check codes , 2001 .

[3]  Jinghu Chen,et al.  Decoding low-density parity check codes with normalized APP-based algorithm , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[4]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[5]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[6]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[7]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..