×

zbMATH — the first resource for mathematics

MB iterative decoding algorithm on systematic LDGM codes: performance evaluation. (English) Zbl 1177.94121
Summary: We investigate the performance of regular systematic low-density generator matrix (LDGM) codes under the majority rule based (MB) iterative decoding algorithm. We derive a recursive form which can be used to extract the error performance of the code. Based on the recursive expression, we derive a tight non-recursive lower bound. These results can serve as efficient tools to evaluate the performance of the code for different degrees.
MSC:
94A29 Source coding
Software:
LDGM
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] J.F. Cheng, R.J. McEliece, Some high-rate near capacity codes for the Gaussian channel, in: Proceedings of 34th Allerton Conference on Communication, Control and Computing, Monticello, IL, October 1996.
[2] Garcia-Frias, J.; Zhong, W.: Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix, IEEE communication letters 7, No. 6, 266-268 (2003)
[3] L. Ping, S. Chan, K.L. Yeung, Iterative decoding of multi-dimensional concatenated single parity check codes, in: Proceedings of IEEE International Conference on Communication, Atlanta, GA, June 1998, pp. 131 – 135.
[4] M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, V. Stemann, Practical loss-resilient codes, in: Proceedings of 29th ACM Symposium on Theory of Computing, El Paso, TX, May 1997, pp. 150 – 159. · Zbl 0962.68062
[5] X. Bao, J. Li, Matching code-on-graph with network-on-graph: adaptive network coding for wireless relay networks, in: Proceedings of 43th Allerton Conference on Communication, Control, and Computing. Champaign, IL, September 2005.
[6] Zhong, W.; Garcia-Frias, J.: LDGM codes for channel coding and joint source-channel coding of correlated sources, EURASIP journal on applied signal processing 2005, No. 1, 942-955 (2005) · Zbl 1109.94340
[7] Zarrinkhat, P.; Banihashemi, A. H.: Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes, IEEE transactions on communication 52, No. 12, 2087-2097 (2004)
[8] Bazzi, L.; Richardson, T.; Urbanke, R.: Exact thresholds and optimal codes for the binary symmetric channel and Gallager’s decoding algorithm A, IEEE transactions on information theory 50, No. 9, 2010-2021 (2004) · Zbl 1285.94128
[9] Gallager, R. G.: Low-density parity-check codes, (1963) · Zbl 0156.40701
[10] Richardson, T.; Urbanke, R.: Modern coding theory, (2008) · Zbl 1188.94001
[11] Tanner, R. M.: A recursive approach to low complexity codes, IEEE transactions on information theory 27, No. 5, 533-547 (1981) · Zbl 0474.94029 · doi:10.1109/TIT.1981.1056404
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.