Comparison of various constructions of binary LDPC codes based on permutation matrices
Ensembles of low-density parity check codes based on permutation matrices are considered. Algorithms for generation of check matrices of such codes are proposed. The results of simulation of the obtained code constructions for an iterative belief propagation (sum-product) decoding algorithm applied in the case of transmission of a code word via a binary channel with an additive Gaussian white noise are presented.
KeywordsError Probability LDPC Code Code Word Cyclic Shift Permutation Matrice
Unable to display preview. Download preview PDF.
- 1.R. G. Gallager, Low-Density Parity-Check Codes (MIT Press, Massachusetts, 1963).Google Scholar
- 7.A. A. Davydov, M. Giulietti, S. Marcugini, and F. Pambianco, “On the Spectrum of Possible Parameters of Symmetric Configurations,” in Proc. 12th Int. Symp. on Problems of Redundancy in Information and Control Systems, St. Petersburg, Russia, May, 2009, (St. Petersburg. Gos. Univ. Aerospace Instrumentation (SUAI), St. Petersburg, 2009), pp. 69–54.Google Scholar
- 10.I. V. Zhilin, P. S. Rybin, and V. V. Zyablov, “Comparison of Decoding Algorithms for Binary LDPC Codes with a Rigid Input,” in Proc. 34th Int. Conf. Young Researchers and Specialists IPPI RAN “Informational Technologies and Systems”, Gelendzhik, 2011 (IPPI RAN, Moscow, 2011), pp. 221–227.Google Scholar