Design of Modified Minsum Decoder of LDPC Code in the Simplified Difference-Domain

Article Preview

Abstract:

In this paper, we propose the modified minsum decoding algorithm of LDPC(Low-Density Parity-Check) code in the simplified difference-domain on the basis of detailed analysis of LDPC decoding algorithm in difference-domain. The simulation indicates that the proposed decoding algorithm offers almost no performance degradation compared with the BP(Belief Propagation) decoding algorithm in log-domain and the decoding algorithm in difference-domain and offers better performance than minsum decoding algorithm in log-domain and greatly reduces the computation complexity in AWGN(Additive White Gaussian Noise) channel and under BPSK(Binary Phase Shift Keying) modulation.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1576-1581

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. G. Gallager Low density parity check codes(MIT, Cambridge 1962).

Google Scholar

[2] D. J. C. MacKay:Neal R M. Near Shannon limit performance of low density parity check codes. Electronics Letters. Vol. 32-18(1996), p.1645.

DOI: 10.1049/el:19961141

Google Scholar

[3] M.C. Davey:Error-correction using Low-Density Parity-Check code. ( Gonville and Caius College , Cambridge 1999).

Google Scholar

[4] M. Luby,M. Mitzenmacher, M. A. Shokrollahi: Practical loss-resilient codes(Proc. of 29th Annual ACM Symposium on Theory of Computing, 1997).

DOI: 10.1145/258533.258573

Google Scholar

[5] M. Luby, M. Mitzenmacher , M. A. Shokrollahi: Analysis of random processes via and-or tree evaluation(Proc. of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998).

Google Scholar

[6] G. D. Forney: The forward-backward algorithm(Proc. of 34th Allerton Conference Communications, Control and Computing, 1996).

Google Scholar

[7] N. Wiberg: Codes and decoding on general graphs(Linkoping University, Sweden 1996).

Google Scholar

[8] J. Chen, M. P. C. Fossorier: Near Optimum universal belief propagation based decoding of low-density parity check code. IEEE Trans. on Communication. Vol. 50-3(2002), p.406.

DOI: 10.1109/26.990903

Google Scholar

[9] Saeyoun Chun : On the construction of some capacity-approaching coding schemes(MIT, Cambridge 2000).

Google Scholar

[10] Haijun Lei, Peng Liu and Yejun He: The simplified difference-domain LDPC decoding algorithm based on RMP-scheduling. Journal of Sichuan University. Vol. 49-3(2012), p.584.

Google Scholar

[11] Zhiping Shi: Nobinary Low-Density Parity-Check Codes and Their Applications in Wireless Communications (National Defense Industry Press, Beijing 2012).

Google Scholar