Bioinspired approach to optimization of decoding low-density parity-check codes

Authors

  • Н.А. Штомпель

Abstract

The features of the major decoding methods of low-density parity-check codes are considered. It is shown that to improve the efficiency of the min-sum decoding it is necessary to apply normalization of computations at the vertices of the Tanner graph. An approach to optimization of the min-sum decoding based on generalized bioinspired procedures with a reduced computational complexity is proposed.

References

Richardson, T.J., Urbanke, R.L. The capacity of low-density parity-check codes under message-passing decoding // IEEE transactions on information theory. – 2001. – Vol. 47, № 2, February. – P. 599–618.

Fossorier, M., Mihaljevic, M., Imai, H. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation // IEEE transactions on information theory. – 1999. – Vol. 47, № 5, May. – P. 673–680.

Zhang, J., Fossorier, M., Gu. D., Zhang, J. Improved min-sum decoding of LDPC codes using 2-dimensional normalization // IEEE Global telecommunications conference. – 2005. Vol. 3. – P. 1187 –1192.

Штомпель, Н.А. Оптимизация нерегулярных кодов с малой плотностью проверок на четность на основе природных вычислений // Радиотехника. – 2016. Вып. 186. – С. 207 – 210.

How to Cite

Штомпель, Н. (2016). Bioinspired approach to optimization of decoding low-density parity-check codes. Radiotekhnika, 4(187), 34–37. Retrieved from http://rt.nure.ua/article/view/210813

Issue

Section

Articles